code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <iostream>
using namespace std;
int main(void){
int asum = 0,bsum = 0;
for(int i = 0;i < 4;i++){
int x;
cin >> x;
asum += x;
}
for(int i = 0;i < 4;i++){
int x;
cin >> x;
bsum += x;
}
cout << max(asum,bsum) << endl;
return 0;
} | #include <bits/stdc++.h>
#include <string>
using namespace std;
int a,b,c;
char op;
int main(){
cin>>a>>op>>b;
c=(int)op;
if(c==43){
cout<<a+b<<endl;
}
else if(c==45){
cout<<a-b<<endl;
}
} | 0 | 12,779,101 |
#include<bits/stdc++.h>
using namespace std;
const long long INF=1LL<<60;
long long dist[210][210];
int main(){
int N,M,R;
cin >> N >> M >> R;
vector<int> r(R);
for(int i=0;i<R;++i){
cin >> r[i];
r[i]--;
}
for(int i=0;i<210;++i){
for(int j=0;j<210;++j){
dist[i][j]=INF;
}
dist[i][i]... | #include<iostream>
#include<vector>
#include <cmath>
#include <map>
#include <set>
#include <algorithm>
#include <string>
#define rep(i,n) for (int i= 0;i<(n);++i)
using namespace std;
typedef long long ll;
int main()
{
ll a1 , a2 ;
ll N ;
cin >> N ;
ll a[N] ;
ll b[N] ;
for(ll i = 0 ; i < N ; ... | 0 | 38,720,670 |
#include <bits/stdc++.h>
using namespace std;
const int MOD=1e9+7;
const int INF=1e9;
const long long LINF=1e18;
#define int long long
template <typename T>
void fin(T a){
cout<<a<<endl;
exit(0);
}
signed main(){
int N;cin>>N;
std::vector<int> v(N);
for(int i=0;i<N;i++)cin>>v[i];
sort(v.begin(),v.end());
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e2 + 3;
#define F first
#define S second
ll n , x , y , X , Y;
pair<ll, ll> A[2*N];
pair<ll, ll> prefix[2*N];
int quad(pair<ll,ll> &a){
if(a.F >= 0 && a.S >= 0)
return 1;
else if(a.F < 0 && a.S >= 0)
return 2;
else if(a.F < 0 && a... | 0 | 55,447,568 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long x; cin >> x;
long y = x%100;
long cnt = 0;
for(int i=5;i>0;i--){
cnt += y/i; y %= i;
}
if(cnt > x/100)cout << 0 << endl;
else cout << 1 << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
const int N = 10000;
const int WHITE = 0;
const int GRAY = 1;
const int BLACK = 2;
vector<int> G[N];
vector<int> ans;
int V;
int degIn[N], color[N];
queue<int> Q;
void bfs(int s){
if( degIn[s] > 0 || color[s] == BLACK)... | 0 | 32,293,334 |
#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <bitset>
#include <string>
#include <cstdio>
#include <math.h>
using namespace std;
const long long int INF = 1000000007;
int main(void)
{
long long N;
cin >> N;
if (N % 2 == 0)
{
... | #include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<set>
#include<string>
#include<map>
#include<string.h>
#include<complex>
#include<math.h>
#include<queue>
#include <functional>
#include<time.h>
#include <stack>
#include<iomanip>
using namespace std;
#define rep(i,a,n) for(int i=(a);i<(... | 0 | 58,611,001 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdlib>
#include <map>
#include <iomanip>
#include <set>
#include <stdio.h>
#include <ctype.h>
using namespace std;
#define pie 3.141592653589793238462643383279
#... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define lvector vector<ll>
#define lque queue<ll>
#define lpque priority_queue<ll>
#define dlpque priority_queue<ll,lvector,greater<ll>>
#define P pair<ll,ll>
#define ALL(a) (a).begin(),(a).end()
#define rep(i,n) for(ll (i)=0; (i)<(n); ++(i))
#define pr... | 0 | 11,611,641 |
#include <iostream>
using namespace std;
int main(int argc, char** argv) {
string S, T;
int A, B;
cin >> S >> T >> A >> B;
string U;
cin >> U;
if (U == S) {
A--;
}
else {
B--;
}
cout << A << " " << B << "\n";
return 0;
} | #include <iostream>
#include <algorithm>
#define N 10000
using namespace std;
struct s{
int d;
int p;
int dcnt;
};
int main(){
int n,m,i,j,flag,kitaiti;
struct s data[N];
while(1){
flag=0;
kitaiti=0;
cin >> n >> m;
if(n==0&&m==0) break;
for(i=0;i<n;i++){
cin >> data[i].d >> data[i]... | 0 | 88,124,435 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void fail()
{
cout << 0 << '\n';
exit(0);
}
int f(int x)
{
int res = 0;
while (x % 2 == 0) {
x /= 2;
++res;
}
return res;
}
ll lcm(ll x, ll y)
{
return x / __gcd(x, y) * y;
}
signed main()
{
cin.tie(0);
ios::sync_with_stdio(fa... | #include <bits/stdc++.h>
using namespace std;
#define INF 1e9
#define LLINF 1e18
#define pi 3.14159265358979323
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int gcd(int a, int b) {
if(a % b == 0) {
return b;
}
else {
return(gcd(b, a % b));
}
}
int main() {
... | 0 | 79,680,956 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
const int INF = (1 << 29);
int main()
{
while (1)
{
int n, k;
cin >> n >> k;
if (n == 0 && k == 0)
break;
int a[n];
rep(i, n) cin >> a[i];
int s[n + 1];
s[0] = 0;
rep(i, n + 1) s[i + 1] ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
typedef long long ll;
const ll M=1000000007;
int main(){
int N,Y;cin>>N>>Y;
int ansx=-1;
int ansy=-1;
int ansz=-1;
rep(x,N+1){
rep(y,N+1){
int z=N-x-y;
if(0<=z &&z<=N){
int total=10000*x + 50... | 0 | 99,797,872 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main(){
ll n;
cin >> n;
vector<pair<ll,ll>> p(n);
rep(i, 0, n) {
cin >> p[i].first;
p[i].second = i+1;
}
sort(p.begin(), p.end(), ... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define oset tree<long long, null_type,less_equal<long long>, rb_tree_tag,tree_order_statistics_node_update>
using ll = long long;
ll mod=1e9+7;
int main() {
ios:... | 0 | 96,871,017 |
#include<vector>
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<algorithm>
#define INF 10**9+7
using namespace std;
using Graph = vector<vector<int> >;
bool check(long long a,long long b,long long c){
return true;
}
int main(){
long long A,B,C;
cin >> A >> B >> C;
if... | #include<iostream>
#include<vector>
#include<queue>
struct Node{
int value = 0;
};
int main(void){
int n, q;
std::cin >> n >> q;
std::vector<Node> node(n);
std::vector<int> used(n);
std::vector<std::vector<int>>edge(n);
int a, b;
for(int i = 0; i < n-1; i++){
std::cin >> a >> b;
... | 0 | 36,282,715 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
#define MAX 100000
void inarray(int a[], int n){
for(int i = 0; i < n; i++) cin >> a[i];
}
int main(){
int n,k; cin >> n >> k;
ll s[n+1];
s[0] = 0;
for(int i = 1; i <= n; i++){
s[i] = s[i-1] + i;
}
... | #include <iostream>
#include <map>
#include <string>
#include <algorithm>
int main() {
int n;
long long cnt = 0;
std::cin >> n;
std::map<std::string, long long> strs;
for (int i = 0; i < n; i++) {
std::string s;
std::cin >> s;
std::sort(s.begin(), s.end());
if (strs.find(s) == strs.end()) {
strs.insert(... | 0 | 71,195,902 |
#include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
typedef long long ll;
typedef long double ld;
const long long INF = 1e18;
# define len(x) ((int)(x).size())
# define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
# define reps(i, n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
# define rrep(i, n) f... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define size_of_array(array) (sizeof(array)/sizeof(array[0]))
#define max 100005
using ll =long long;
using namespace std;
using Graph=vector<vector<int>>;
char s[4001];
bool isDiff(int i,int j,int k){
if((s[i]!=s[j])&&(s[j]!=s[k])&&(s[k]!=s[i]... | 0 | 69,722,261 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#define pi 3.14159265358979323846264338327950
int main() {
int s; std::cin >> s;
std::vector<int> Check;
bool flag = false;
int count = 0;
while (flag == false) {
Check.push_back(s);
++count;
i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define ALL(vec) vec.begin(), vec.end()
#define rALL(vec) vec.rbegin(), vec.rend()
using namespace std;
using ll = long long;
int main() {
ll N, K;
cin >> N >> K;
vector<pair<int, int>> ve... | 0 | 16,100,232 |
#include <cstdio>
#include <vector>
using namespace std;
#define MAX_V 10000
typedef int int32_t;
int main(void) {
int v, e;
vector<int> g[MAX_V];
int n_in[MAX_V] = {};
scanf("%d %d", &v, &e);
for (int i = 0; i < e; i++) {
int t, u;
scanf("%d %d", &t, &u);
g[t].push_back(u);
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define range(i,a,b) ((a)<=(i) && (i)<(b))
#define debug(x) cout << #x << ' ' << ... | 0 | 8,639,402 |
#include<stdio.h>
#pragma GCC optimize("O2")
static inline int comp(const int a,const int b,int desc){return a<b?(!desc?a:b):(!desc?b:a);}
int main(void)
{
int N,i=scanf("%d",&N)-1,u,v;long x=1l*N*(N+1)*(N+2)/6;
while(i<N-1){i+=scanf("%d %d",&u,&v)>>1;x=x-1l*comp(u,v,0)*(N-comp(u,v,1)+1);}
return printf("%ld",x),... | #include<iostream>
#include<iomanip>
#include<cstdio>
#include<string>
#include<cstring>
#include<climits>
#include<algorithm>
#include<vector>
#include<cmath>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<tuple>
#include<list>
#include<unordered_map>
#define ll long long
#define pii pair<int,int... | 0 | 76,499,190 |
#include <iostream>
#include <cmath>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define ASC(c) sort((c).begin(), (c).end())
#define DESC(c) sort((c).begin(), (c).end(), greater<int>())
#define DUMP(x) ... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <stack>
#include <string>
using namespace std;
main() {
string str;
while(getline(cin, str), str!="."){
string tmp = "";
for(int i = 0; i < str.size(); i++) {
if(str[i] == '(' || str[i] == ')' || str[i] == '[' || str[i] == ']')
... | 0 | 68,612,115 |
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define MOD 1000000007
#d... | #include <iostream>
using namespace std;
typedef long long ll;
int main()
{
int n;
cin >> n;
ll a[200005], b[200005];
ll s = 0;
for(int i = 0; i < n; i++){
cin >> a[i] >> b[i];
s += a[i];
}
ll l = s;
for(int i = 0; i < n; i++){
if(a[i] > b[i]) l = min(l, b[i]);
... | 0 | 48,361,414 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int V, E;
cin >> V >> E;
vector<vector<long long>> dp(V, vector<long long>(V, 1e+15));
for (int i = 0; i < V; i++)
{
dp[i][i] = 0;
}
for (int i = 0; i < E; i++)
{
int s, t, d;
cin >> s >> t >> d;
d... | #include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
int n,m,i,j,d[100005];
int main()
{
scanf("%d%d",&n,&m);
while(m--)
{
scanf("%d%d",&i,&j);
++d[i],++d[j];
}
for(i=1;i<=n;++i)
if(d[i]&1)
{
printf("NO");
return 0;
}
printf("YES");
return 0;
} | 0 | 66,369,855 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <list>
#include <map>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define fi first
... | #include<stdio.h>
#include<algorithm>
#include<vector>
#define fst first
#define snd second
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
int N, M;
char A[100][100+1];
int D[100][100];
int main() {
scanf("%d%d", &N, &M);
for(int i = 0; i < N; i++) {
scanf("%s", A[i]);
}
... | 0 | 45,489,988 |
#include <iostream>
int main (int argc, char* argv[])
{
std::string s, t, u;
int a, b;
std::cin >> s >> t >> a >> b >> u;
if (s == u) a--;
else b--;
std::cout << a << " " << b << std::endl;
return 0;
} | #include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<cmath>
#include<cstring>
#include<set>
#include<climits>
using namespace std;
#define intmax INT_MAX
#define lma... | 0 | 46,328,797 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
bool is_square(int n)
{
for (int i = 0; i <= n; i++)
{
if (i * i == n)
{
return true;
}
}
return false;
}
int main()
{
string s;
ll k;
cin >> s >> k;
ll first_not1 = 1000000000000000000... | #include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> b(n);
for (int i = 0; i < n; i++) {
cin >> b[i];
}
vector<lon... | 0 | 41,809,202 |
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define MOD 1000000007
using namespace std;
int main() {
int n;
cin >> n;
string s, t;
cin >> s >> t;
int ans = 2 * n;
for (int i = n - 1; i >= 0; i--) {
if (s.substr(i, n - i) == t.substr(0, n - i)) {
... | #include <bits/stdc++.h>
using namespace std;
#define sws ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define ll long long
#define vi vector<int>
#define pb push_back
#define pii pair<int, int>
#define mp make_pair
#define ff first
#define ss second
#define vvi vector<vi>
#define all(x) x.begin(), x.end()
#de... | 0 | 47,041,203 |
#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"
... | #include <iostream>
#include <algorithm>
#include <vector>
#include <climits>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define repR(i, n) for(int i = (n) - 1; i > -1; i--)
#define rep1(i, n) for(int i = 1; i < (int)(n + 1); i++)
#define rep1R(i, n) for(int i = (n); i > 0; i--)
#define ll long long
using name... | 0 | 7,222,452 |
#define MOD 1000000007
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
ll A[100000];
int main(){
int i;
ll a = 0, b, c, z = 0;
cin >> N;
for (i = 0; i < N; i++) {
cin >> A[i];
a ^= A[i];
}
for (b = 1LL << 59; b; b >>= 1) {
if (b & a) continue;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = (1 << 28);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes cout << "Yes" << endl... | 0 | 36,758,112 |
#include <iostream>
#include<time.h>
#include<string>
#include<cstring>
#include <cstdio>
#include<utility>
#include<algorithm>
#include<vector>
#include<cmath>
#include<map>
#include<bitset>
#include<queue>
#include<stack>
#include<set>
#include <limits>
#include <climits>
#include <numeric>
#include<cassert>
#include... | #include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<ll,ll>;
using ld=long double;
int main(){
ll a,b,c;cin >>a>>b>>c;
ll ans=INF;
for (int i = 0; i <=100; ++i) {
ll n... | 0 | 13,545,993 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N, Y;
bool flag = false;
cin >> N >> Y;
for (int i = N; i >= 0; i--)
{
for (int j = N - i; j >= 0; j--)
{
for (int k = N - i - j; k >= 0; k--)
{
if ((10000 * i) + (5000 * j) + (1000 * k) == Y && i + j + k == N)
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll N,minimum=1000000000;
cin>>N;
vector<ll> A(N);
for(ll i=0;i<N;i++){
cin>>A.at(i);
minimum=min(minimum,A.at(i));
}
while(true){
ll x=minimum;
ll check=0;
ll count=0;
for(ll i=0;i<N;i++){
if(A.at(i)... | 0 | 9,127,598 |
#include<bits/stdc++.h>
#define all(x) x.begin(),x.end()
#define pb push_back
#define mp make_pair
#define Unique(x) x.erase(unique(all(x)),x.end());
#define CIN_FILE "input.txt"
#define COUT_FILE "output.txt"
#define Pig (OO)
using namespace std;
const int dx[]={-1,0,1,0};
const int dy[]={0,-1,0,1};
inline int read()
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
string S;
cin>>N>>S;
bool ans=true;
if(N==1){
cout<<"No"<<endl;
ans=false;
}
for(int i=0;i<N/2;i++){
if(N%2!=0){
cout<<"No"<<endl;
ans =false;
break;
}else if(S.at(i)!=S.at(N/2+i)){
cout<<"No"<<endl;
... | 0 | 72,505,401 |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
typedef long long ll;
typedef unsigned long long ull;
void oneCase() {
double r, g;
cin >> r >> g;
cout << r + (g - r) * 2 << "\n";
}
int main() {
int t = 1;
while (t--) {
oneCase();
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num){ return log10(num)+1; }
int main()
{
int h, w;
cin >> h >> w;
vector<vector<char>> s(h, vector<char>(w));
rep(i,h) rep(j, w) cin >> s[i][j];
rep(i,h)rep(j,w){... | 0 | 84,763,115 |
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout <<(#x)<<" is "<<(x)<<endl
#define debug cout <<"hi"<<endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, i... | #include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | 0 | 50,868,143 |
#define _USE_MATH_DEFINES
#pragma region include
#include <iostream>
#include <iomanip>
#include <stdio.h>
#include <sstream>
#include <algorithm>
#include <iterator>
#include <cmath>
#include <complex>
#include <string>
#include <cstring>
#include <vector>
#include <bitset>
#include <queue>
#include <set>
#include <ma... | #include <sstream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>
using namespace std;
#define MAXN 100010
#define INF 10000000000L
int... | 0 | 44,903,931 |
#include <bits/stdc++.h>
using namespace std;
int diveder(long long x, int d){
int ret = 0;
while(x > 0){
ret += x % d;
x /= d;
}
return ret;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << setprecision(20) << fixed;
long long N;
cin >> N;
int min = 999999;
for (int i = 0; ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1000000007;
constexpr ll INF = 1ll<<60;
int main(int argc, char **argv)
{
ll N, K, S; cin >> N >> K >> S;
vector<ll> res;
for (ll i = 0; i < K; ++i)
res.push_back(S);
ll t;
if (S == 1000000000)
t = 1000000000-1;
else
t = ... | 0 | 4,990,695 |
#include<iostream>
using namespace std;
double f(double x){
return x*x;
}
int main(){
int sum = 0;
int d;
while(cin>>d){
sum = 0;
for(int i=1;d*i<600;i++){
sum += f(i*d)*d;
}
cout<<sum<<endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
int main()
{
int n;
string s;
cin >> n >> s;
vector<vector<int>> v(n,vector<int>(26));
for(int i = 0;i<n;i++)
{
v[i][s[i]-'a']++;
}
for(int i = n-1;i>0;i--)
{
for(int j=0;j<26;j++)
{
(v[i-1][j]+=v[i][j])%=MOD;
... | 0 | 77,766,702 |
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#in... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for(int i=0; i<(n); ++i)
const int dx[] = {-1, 0, 1, 0}, dy[] = {0, -1, 0, 1};
int W, H;
inline bool inrect(int x, int y){
return 0 <= x && x < H && 0 <= y && y < W;
}
int dfs(vector<string>& room, int x, int y){
room... | 0 | 35,065,988 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define rep1(i,n) for(int i=1;i<=(int)n;i++)
#define sp(n) cout << fixed << setprecision(n)
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... | #include <iostream>
#include <vector>
typedef long long ll;
using namespace std;
ll ans = 0;
vector<ll> v;
void sliding_window(string s) {
int left = 0, right = 0;
while(left < s.size()) {
while(right+1<s.size() && s[left]==s[right+1]) {
right++;
}
v.push_back(right-left+1);
... | 0 | 75,425,020 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb push_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <iomanip>
#include <set>
#include <map>
#include <queue>
typedef long long ll;
using namespace std;
ll rek(ll a, ll b)
{
if (a == b)
{
return a;
}
if (a < b)
{
swap(a, b);
}
... | 0 | 84,396,589 |
#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 i, N, count=0;
vector<bool> num(26);
string S;
cin >> S;
rep(i,26) num[i] =false;
rep(i,S.size()){
num[S[i]-'a'] = true;
}
rep(i,26) {
if(n... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define rep(i,x,y) for(ll i=x;i<y;i++)
#define nvarep(n,a) ll n;cin>>n;vector<ll>a(n);rep(i,0,n)cin>>a[i]
#define vecrep(n,a,type) vector<type>a(n);rep(i,0,n)cin>>a[i]
#define lcm(a,b) (a/__gcd(a, b)*b)
#define range(a) (a).begin()... | 0 | 35,176,832 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(){
string s1,s2;
cin >> s1 >> s2;
int s1len = (int)s1.size();
int s2len = (int)s2.size();
vector<vector<int> > D(s1len+1 ,vector<int>(s2len+1, 0));
for(int i=0;i<=s1len;++i){
D[i][0]=i;
}
for(int ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int w, h;
cin >> w >> h;
vector<ll> p(w), q(h), s(h + 2);
ll ans = 0;
rep(i, 0, w) {
cin >> p[i];
ans... | 0 | 44,870,883 |
#include <bits/stdc++.h>
using namespace std;
int a, b, x;
const double PI = acos(-1);
int main() {
double a,b,x; cin >> a >> b >> x;
x /= a;
auto f=[&](double t){
if (tan(t)<=b/a) return a*b - (a*a*tan(t))/2;
else return b*(b/tan(t))/2;
};
double ok = 0.0;
double ng = PI/2.0;
... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
#define fi first
#define se second
#define pb push_back
#define fi first
#define se second
#define vi vector<int>
typedef pair<int,int> P;
#define REP(i,x,y) for(int i=x;i<=y;i++)
#define abs(x) ((x)>0?(x):-(x))
#define y1 hhf
#... | 0 | 33,007,560 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int H, W;
cin >> H >> W;
vector<string> ans(2 * H);
for (int i = 0; i < H; i++)
{
string r;
cin >> r;
ans[2 * i] = r;
ans[2 * i + 1] = r;
}
for (int i = 0; i < ans.size(); i++)
cout << ans[i] <... | #include <iostream>
using namespace std;
int main(void){
int a,b,c;
cin>>a>>b>>c;
if (a<=b && b<=c){
cout<<a<<" "<<b<<" "<<c<<endl;
}
else if (a<=c && c<=b){
cout<<a<<" "<<c<<" "<<b<<endl;
}
else if (b<=a && a<=c){
cout<<b<<" "<<a<<" "<<c<<endl;
}
else if (b<=... | 0 | 28,556,784 |
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <ostream>
#inclu... | #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 | 21,337,603 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i = 0;i < n;++i)
#define all(v) v.begin(), v.end()
using ll = long long;
int main()
{
ll i,j;
ll n,x,m;
cin >> n >> x >> m;
vector<ll> spare(m, -1);
ll now = x;
rep(i,m){
if(spare[now] != -1) break;
else{
... | #include<stdio.h>
int main(void)
{
int gohyaku,hyaku,gozyu,zyu,go,ichi;
int dai,otsuri,mai;
scanf("%d",&dai);
while(dai!=0){
otsuri=1000-dai;
gohyaku=0;
hyaku=0;
gozyu=0;
zyu=0;
go=0;
ichi=0;
while(otsuri!=0){
while(otsuri>=500){
otsuri=otsuri-500;
gohyaku++;
}
while(otsuri>=100){
... | 0 | 28,053,130 |
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int main() {
int n;
cin >> n;
vector<pair<int,int>> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i].first;
a[i].second = i + 1;
}
sort(all(a));
for (int i = 0; i < n; ... | #include<bits/stdc++.h>
#define ll long long
#define nl "\n"
#define pi acos(-1)
#define fast ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
#define pcase printf("Case %d:\n",ca)
int ca=1;
using namespace std;
int main(){
string a;
cin>>a;
bool ans = false;
for(int i =0;i<3;i++){
... | 0 | 90,398,277 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N;
cin >> N;
ll ans = 1e15;
for(ll i = 1; i*i <= N; i++) {
if(N%i == 0) {
ans = min(ans, i + N/i - 2);
}
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long int ll;
const int INF = 1000000000;
const double PI = 3.1415926535897932;... | 0 | 55,997,851 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define vv(T) std::vector<std::vector<T>>
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long long;
int main(void)
{
int n;
cin >> n;
deque<int> B;
for (int i = 0; i < n; ++i)
{
int a;
cin >> a;
i... | #include <iostream>
#define rep(i, n) for(int i=0; i<n; i++)
using namespace std;
int main(){
string S;
long long K;
cin >> S >> K;
int N = S.size();
string copy = S;
bool all_same = true;
rep(i, N-1)
all_same *= (S[i] == S[i+1] );
if(all_same){
cout << N*K/2 << endl;
return 0;
}
long lo... | 0 | 44,091,242 |
#include <bits/stdc++.h>
#define rep(i,n) for (int (i) = 0; (i) < (n); i++)
#define ll long long
using namespace std;
int main() {
ll a = 0;
cin >> a;
cout << a*a;
} | #ifndef atcoder_defs_hpp
#define atcoder_defs_hpp
#include <cstdio>
#include <cstdint>
#include <cinttypes>
#include <cmath>
#include <string>
#include <vector>
#include <iostream>
#include <utility>
#include <algorithm>
#include <numeric>
#include <functional>
using namespace std;
using i8t = std::int64_t;
using u8t =... | 0 | 66,336,658 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 10000000... | #pragma GCC optimize("O3")
#include<bits/stdc++.h>
#include<map>
#include<iostream>
#include <cstring>
#include <iomanip>
#include <algorithm>
#define forr(i,a,b) for(int i=a;i<=b;i++)
#define F first
#define S second
#define input ios_base::sync_with_stdio(0);cin.tie(0);
const double PI = acos(-1.0);
using namespace ... | 0 | 67,216,106 |
#include <bits/stdc++.h>
typedef std::map <int, int> map;
const int N = 200054;
int n, a[N];
map M;
inline bool check(int B) {
int i, L = a[1]; bool result;
map::iterator it; M.clear();
for (i = 2; i <= n; ++i) if (a[i] <= L) {
for (L = a[i]; !M.empty(); )
if (it = --M.end(), it->first >= L) M.erase(it);
els... | #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 | 37,315,322 |
#include <iostream>
#include <string>
using namespace std;
string str;
void change(){
for(char i = 'a' ; i <= 'z' ; i++) str[i] = i;
for(char i = 'A' ; i <= 'Z' ; i++) str[i] = i;
for(char i = '0' ; i <= '9' ; i++) str[i] = i;
}
int main(){
int n;
while(cin >> n,n){
str = "";
change(... | #include "bits/stdc++.h"
#include <chrono>
using namespace std;
using namespace std::chrono;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define forn(ii,nn) for (int ii = 0; ii < nn; ++ii)
#define gcd(ade,bde) __gcd(ade,bde)
#define vi vector<int>
#define vll vector<ll>
#define vs vect... | 0 | 66,819,640 |
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<cassert>
#include<iostream>
#include<sstream>
#include<string>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<utility>
#include<numeric>
#include<algorithm>
#include<bitset>
#include<complex>
using namespace std;
typede... | #include<bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define fo(i,n) for(int i=0;i<n;i++)
#define Fo(i,k,n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define ll long long
#define si(x) scanf("%d",&x)
#define sl(x) scanf("%lld",&x)
#define ss(s) scanf("%s",s)
#define pi(x) printf("%d\n",x)
#define pl(x) pri... | 0 | 10,777,827 |
#include<cstdio>
const int N=100005;
int n,v[N],he[N],to[N*2],nx[N*2],d[N],fa[N];
inline void wk(int w,int x,int y)
{to[w]=y,nx[w]=he[x],he[x]=w;}
inline int imx(int x,int y){return x>y?x:y;}
int dfs(int x)
{
int a=0,b=0,c=0;
for(int i=he[x],y;i;i=nx[i])if((y=to[i])!=fa[x])
{c=1,fa[y]=x;if(!dfs(y))return 0;a+=v[y],b... | #include <bits/stdc++.h>
#define rep(i,N) for(int i = 0; i < N;i++)
#define ALL(a) (a).begin(),(a).end()
#define ll long long int
#define PI 3.14159265358979323846264338327950L
using namespace std;
const ll MOD = (pow(10, 9) + 7);
ll dig(ll N, ll K) {
ll dig = 0;
while (N) {
dig++;
N /= K;
}
return dig;
}
ll gc... | 0 | 32,316,527 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
int k,a,b;cin>>k>>a>>b;
if(a%k==0||b%k==0) cout<<"OK"<<endl;
else if(a/k<b/k) cout<<"OK"<<endl;
else cout<<"NG"<<endl;
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(void) {
int N,K;cin>>N>>K;
vector<int> L;
for (int i = 0;i < N; i++) {
int l;cin>>l;
L.push_back(l);
}
sort(L.begin(), L.end());
int result = 0;
for (int i = N - 1; i >= N - K; i--) {
... | 0 | 68,101,496 |
#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;
struct Train
{
int c,s,f;
};
int main() {
in... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n); for(ll i = 0; i < (ll)n; i++)
vector<long long> enum_divisors(long long N) {
vector<long long> res;
for (long long i = 1; i * i <= N; ++i) {
if (N % i == 0) {
res.push_back(i);
... | 0 | 13,039,586 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<numeric>
#include<math.h>
using namespace std;
typedef long long ll;
ll MOD = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
int n;
cin >> n;
int a, b;
cin >> a >> b;
int q... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main(void){
vector<vector<int>> card(3,vector<int>(3));
for (int i=0;i<3;i++) {
for(int j=0;j<3;j++) {
cin >> card[i][j];
}
}
int N;
cin >> N;
vector<int> appear(N);
for (int i=0;i<N;i++) {
... | 0 | 64,893,419 |
#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;
#define SIZE 100005
struct Info{
bool operator<(const struct Info &arg) const{
return A < arg.A;
}... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define REP1(i, n) FOR(i, 1, (n) + 1)
#define ALL(c) (c).begin(), (c).end()
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return fals... | 0 | 36,751,680 |
#include <iostream>
using namespace std;
int main()
{
int m, f, r;
for(;;)
{
cin >> m >> f >> r;
if(f == -1 && m == -1 && r == -1) break;
if(m != -1 && f != -1)
{
if (m+f >= 80) cout << "A" << endl;
else if(65 <= m+f && m+f <80) cout << "B" << endl;
else if(50 <= m+f && m+f <65) cout << "C" <<end... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (int i = 0; i < (int)n; i++)
int main(){
std::vector<std::vector<int>> vec(3,std::vector<int>(3));
rep(i,3) {
rep(j,3) {
cin >> vec.at(i).at(j);
}
}
int n;
cin >> n;
std::vector<int> b(n);
rep(i,n) {
... | 0 | 95,685,840 |
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
bool desc(int a, int b)
{
return a > b;
}
int main()
{
vector<int> vi;
int a, b, c, d, e;
int len;
cin >> a >> b >> c >> d >> e;
vi.push_back(a);
vi.push_back(b);
vi.push_back(c);
vi.push_back(d);
vi.... | 0 | 60,669,472 |
#include <iostream>
#include <cstdlib>
using namespace std;
int n;
void solve()
{
long double x[4],y[4],px[2],py[2];
for(int i = 0; i < 4; i++){
cin >> x[i] >> y[i];
}
px[0] = x[1] - x[0];
px[1] = x[3] - x[2];
py[0] = y[1] - y[0];
py[1] = y[3] - y[2];
if(px[0]*py[1] == px[1]*py[0])
cout << "YES";
else
co... | #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 | 96,986,175 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
const int N = 1e5;
signed main() {
#ifdef _DEBUG
#endif
ios::sync_with_stdio(0); cin.tie(0);
int n;
cin >> n;
vector<int> a(N + 2);
for (int i = ... | #include <iostream>
#include <cstdio>
using namespace std;
typedef long long ll;
const ll M = 1000000007;
ll n, m;
ll a;
ll b[100005];
ll fac[100005];
ll inv[100005];
ll pow(ll p, ll q)
{
ll re = 1;
for(; q; q >>= 1, p = p * p % M)
{
if(q & 1) re *= p, re %= M;
}
return re;
}
ll f(ll p, ll q... | 0 | 86,699,634 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(n); ++i)
#define chmin(x,y) x = min(x,y)
#define chmax(x,y) x = max(x,y)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int inf = 1 << 21;
const ll INF = 1LL << 60;
const ll mod = 1e9+7;
const int dx[4] = {-1, 0, 1, 0};
const int dy[... | #include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>... | 0 | 30,888,477 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
typedef long long ll;
using namespace std;
const int INF = 1e9;
int main() {
int n, m;
cin >> n >> m;
int sum = m * 1900 + (n - m) * 100;
int cnt[6] = {1, 2, 4, 8, 16, 32};
cout << sum * cnt[m] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define sci1(a) scanf("%d",&a)
#define sci2(a,b) scanf("%d %d",&a,&b)
#define sci3(a,b,c) scanf("%d %d %d",&a,&b,&c)
#define scs(s) scanf("%s",s)
#ifndef GET_MACRO
#define GET_MACRO(__1,__2,__3,NAME,...) NAME
#endif
#define sci(...) GET_MACRO(__VA_ARGS__,sci3,sci2,sci1)(__... | 0 | 78,482,750 |
#include<iostream>
using namespace std;
int main()
{
int n,m;
cin>>n>>m;
int r = n*(n-1)/2 + m*(m-1)/2 ;
cout<<r;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
#define DEBUG freopen("in.txt", "r", stdin);
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
string s;
int main(... | 0 | 58,256,689 |
#include <bits/stdc++.h>
using namespace std;;
#define ll long long
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P... | #include <bits/stdc++.h>
using namespace std;
int d[450][450];
void solve() {
int n; cin >> n;
int k = 1;
auto c2 = [](int x){
return x*(x-1)/2;
};
while (c2(k) < n) {
k++;
}
if (c2(k) != n) {
cout << "No"; return;
}
int edge_cnt = 1;
for (int i = 0; i < k... | 0 | 68,521,633 |
#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<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) for(int i=0;i<(int)n;i++)
#define reps(i,n) for(int i=1;i<=(int)n;i++)
#define all(v) ... | 0 | 79,873,917 |
#include <stdio.h>
#include <iostream>
#include <algorithm>
#define rep(index,from,to) for(int index=from;index<to;index++)
using namespace std;
int main(){
int n,m;
int c[25];
int dp[50010];
cin>>n>>m;
rep(i,0,m) cin>>c[i];
sort(c,c+m);
rep(j,0,n+1) dp[j]=j;
rep(i,1,m){
rep(j,0,... | #include <cstdio>
#include <algorithm>
#include <vector>
const int MAXN = 8004;
char S[MAXN];
bool dx[MAXN], dx2[MAXN];
bool dy[MAXN], dy2[MAXN];
int iabs(int x) {
return (x>=0 ? x : -x);
}
int main() {
int X, Y;
std::vector<int> xx, yy;
fgets(S, MAXN, stdin);
scanf("%d%d", &X, &Y);
int i, cnt = 0;
bool i... | 0 | 58,336,152 |
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <cassert>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <bitset>
#include <functional>
#include <sstream>
#include <utility>
#include <cstdlib>
#include ... | #include <iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<deque>
#include<iomanip>
#include<sstream>
#include<cmath>
#include<bitset>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define req(i,n) for(int i = 1;i <= n; i++)
#define rrep(i... | 0 | 78,787,763 |
#include<bits/stdc++.h>
using namespace std;
class uf{
int n;
vector<int> rank, parent;
public:
uf();
uf(int _n){
init(_n);
}
void init(int _n){
n = _n;
rank.resize(n);
parent.resize(n);
for (int i = 0; i < n; i++) {
rank[i] = 0;
parent[i] = i;
}
}
int find(int x){
... | #include <iostream>
#include <ctime>
#include <cstdlib>
#include <sstream>
#include <string>
#include <queue>
using namespace std;
int parent(int i){
return i/2;
}
int left(int i){
return 2*i;
}
int right(int i){
return 2*i +1;
}
int maxheapify(vector <int> &X, int i){
int l, r;
l = left(i);
r = right(i);
if (r ... | 0 | 52,849,159 |
#include<iostream>
using namespace std;
int main(){
for(int i=1;i<=9;i++)
for(int j=1;j<=9;j++)
cout<<i<<'x'<<j<<'='<<i*j<<endl;
return 0;
} | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
#include<deque>
#include<map>
#include<stack>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
typedef pair<ll,ll> pll;
const int INF=1e9;
const ll MOD=1e9+7;
int dy[]={1,0,-1,0}... | 0 | 29,639,690 |
#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using bint = boost::multiprecision::cpp_int;
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define repSE(i,s,n) for (int i = (s); i < (n); i++)
#define ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<string> P(N, "WA");
vector<int> V(N, 0);
int p;
string S;
for (int i=0; i<M; i++) {
cin >> p >> S;
if (P[p-1]=="WA") {
if (S=="WA") {
V[p-1]++;
}
else {
P[p-1]=S;
}
... | 0 | 91,436,425 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int t[1000][3], cnttri, dataset_num, i;
cin>>dataset_num;
for(cnttri=0;cnttri<dataset_num;cnttri++){
cin>> t[cnttri][0] >> t[cnttri][1]>> t[cnttri][2];
sort(t[cnttri], t[cnttri]+3);
}
for(i=0;i<dataset_num;i++){
if(t[i][2]*t[i][2] == t... | #include <iostream>
#include <cstdio>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
using namespace std;
#define REP(i,n) for(int (i)=0; (i)<(n); (i)++)
#define For(i,a,b) for(int (i)=(a); (i)<(b); (i)++)
void solve(int N) {
int M;
map<char, char> v;
REP(i, N) {
char a, b;
... | 0 | 42,424,721 |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << (#var) << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
}
const int N = 1e5+23;
int a[N];
void solve() {
int n, m; scanf("%d%d", &n, &m);
for (int ... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin >> n >> m;
vector<vector<string>> problem_array(n,vector<string>(0));
for(int i=0;i<m;i++){
int num;
string res;
cin >> num >> res;
problem_array.at(num-1).push_back(res);
}
long long penalty=0... | 0 | 66,521,499 |
#include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long ll;
typedef pair<ll,ll> P;
const ll mod=1000000007;
const ll LINF=1LL<<60;
const int IN... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#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);... | 0 | 44,491,956 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<bool> vb;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define INT(str) stoi((str), 0)
#define INTB(str) stoi((str), 0, 2)
int main() {
int K, X;
cin >> K >> X;;
cout << (X <= 500 * K ? "Yes" : "No") << endl;... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
vector<ll> lunlun = {1, 2, 3, 4, 5, 6, 7, 8, 9};
void make_lunlun(ll a, int n) {
if (n <= 10) {
if (a % 10 == 0) {
lunlun.push_back(a*10);
make_lunlun(a*10, n+1);
lunlun.push_back(a*10+1);
make_lunlun(a*10+1, n+1);
} el... | 0 | 40,646,282 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int h,w;
cin >> h >> w;
vector<vector<int>> color(h, vector<int>(w));
for(int i=0; i<h; i++){
for(int j=0; j<w; j++){
char c;
cin >> c;
if(c == '#') color.at(i).at(j) = 1;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,s,n) for (int i = (int)s; i < (int)n; i++)
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define All(x) x.begin(), x.end()
#define Range(x, i, j) x.begin() + i, x.begin() + j
#define lbidx(x, y) lower_bound(x.begin(),... | 0 | 30,571,551 |
#include <iostream>
#include <set>
#include <vector>
#include <string>
#include <algorithm>
#include <iterator>
#include <map>
#include <utility>
#include <list>
#include <climits>
#include <bitset>
#include <numeric>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define repi(i, n) for(auto i = (n).... | #include<iostream>
using namespace std;
int main(){
char c;
cin>>c;
if(c=='a'){
cout<<"b"<<endl;
}
else if(c=='b'){
cout<<"c"<<endl;
}
else if(c=='c'){
cout<<"d"<<endl;
}
else if(c=='d'){
cout<<"e"<<endl;
}
else if(c=='e'){
cout<<"f"<<endl;
}
else if(c=='f'){
cout<<"g"<... | 0 | 16,757,693 |
#include "bits/stdc++.h"
#include <unordered_set>
#define _CRT_SECURE_NO_WARNINGS
#define REP(i, n) for(decltype(n) i = 0; i < (n); i++)
#define REP2(i, x, n) for(decltype(x) i = (x); i < (n); i++)
#define REP3(i, x, n) for(decltype(x) i = (x); i <= (n); i++)
#define RREP(i, n) for (decltype(n) i = (n) - 1; i >= 0; i--... | #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()
int main(){
int n,k;
cin >> n >> k;
vector <int> A(n);
rep(i,n) cin >> A[i];
if(n == 1){
cout << min(n,k) << endl;
}
else{
for(int l=1; l<=min(k,50); l... | 0 | 20,927,699 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
#define Graph vector<vector<int>>
int main() {
int N, D, X; cin >> N >> D >> X;
vector<int> A(... | #include <iostream>
#include <cmath>
#include <algorithm>
#include <utility>
#include <vector>
using namespace std;
inline int calc(int Y, int M, int D)
{
int day = 1;
for (int y = Y; y < 1000; y++) {
day += (y % 3 == 0) ? 200 : 195;
}
day -= D;
for (int m = 1; m <= M - 1; m++) {
day... | 0 | 88,948,986 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n), b(n), c(n);
int dp[n][3];
for(int i = 0; i < n; i++){
cin >> a[i] >> b[i] >> c[i];
}
dp[0][0] = a[0];
dp[0][1] = b[0];
dp[0]... | #include <bits/stdc++.h>
using namespace std;
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
#define abs(a) max((a),-(a))
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define repe(i,n) rep(i,(n)+1)
#define per(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define pere(i,n) rep(i,(n)+1)
#define all(x) (x).b... | 0 | 66,668,505 |
#include <bits/stdc++.h>
using namespace std;
using pint = pair<int,int>;
const long long INFLL = 1LL << 60;
const int INFI = 1000000000;
int main(){
int N; cin >> N;
map<long long, int> m{};
for(int i=0;i<N;i++){
long long a; cin >> a;
m[a]++;
}
long long ans =0;
for(auto i=m.be... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp setprecision
#define pb(x) push_back(x)
using ll = long long;
using ld = long double;
using pii =... | 0 | 94,023,167 |
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#define endl "\n"
#define sz(x) ((ll)(x).size())
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define prt(x) cout << (x)
#define prtl(x) cout << (x) << endl
#define rep(i,a,b) for(ll i=a; i<b; i++)
#define rrep(i,a,b) for(ll i=a; i>b; i--)
#define mp(a, ... | #include<iostream>
#include<string>
using namespace std;
int main()
{
int n, k = 0;
string s[200], a[100], b[100], w;
cin >> n;
for(int i = 0; i < n; i++)
{
cin >> w;
s[i] = w;
a[i] = w[w.size() - 1];
b[i] = w[0];
}
for(int j = 0; j < n; j++)
{
for... | 0 | 57,826,419 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define rep1(i,n) for(int i=1;i<=(int)n;i++)
#define sp(n) cout << fixed << setprecision(n)
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... | #include<cmath>
#include<iostream>
#include<cstdio>
#include<iomanip>
#include<cctype>
#include<cstring>
using namespace std;
int main() {
char x[1001];
while (1) {
int sum = 0;
cin >> x;
if (x[0] == '0')break;
for (int i = 0; x[i]; i++) {
sum += (x[i] - '0');
}
cout << sum << endl;
}
return 0;
} | 0 | 69,230,760 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 6.66;
long long val [ MAXN ] ;
vector<int> tree [ MAXN ] ;
long long dfs ( int v,int p ) {
if ( tree[v].size ( ) == 1 ) return val [ v ] ;
if ( p != -1 && tree[v].size ( ) == 2 ) {
int u = tree[v][0] ;
if ( u == p ) u = tree[v][1] ;
if... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (ll i = 1; i <= (ll)(n); i++)
#define INF 10000000000
#define MOD 1000000007
using ll = long long;
using Graph = vector<vector<int>>;
int main(){
int H,W,K; cin>>H>>W>>K;
vector<string> S(H);
... | 0 | 93,412,553 |
#include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { ... | #include <iostream>
#include <cstring>
#include <stdlib.h>
#include <vector>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <math.h>
#include <string>
#include <map>
#include <cstdlib>
#include <sstream>
#include <bitset>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P... | 0 | 71,591,945 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
char n[4];
cin>>n;
if(n[0]=='7'||n[1]=='7'||n[2]=='7'){
cout<<"Yes";
}else{
cout<<"No";
}
} | #include <string.h>
#include <stdlib.h>
#include <math.h>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <iomanip>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <utility>
#include <limits.h>
#include <bitset>
#include <... | 0 | 6,129,291 |
#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()
#define endl "\n"
using ll = long long;
using P = pair<int,int>;
using mp = map<string,int>;
const int MOD = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(... | #include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<cstring>
#include<queue>
#include<stack>
#include<numeric>
using namespace std;
#define INF (1 << 30) - 1
#define LINF 1LL << 60
const int MOD = 1000000007;
using ll = long long;
using P = pair<int, int>;
int m... | 0 | 93,906,515 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int R,G;
cin >> R >> G;
cout << G + G - R;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pll;
typedef pair<ll,pair<ll,ll>>plll;
#define fastread() (ios_base:: sync_with_stdio(false),cin.tie(NULL));
#define vll(v) v.begin(),v.end()
#define all(x) x.rbegin(),x.rend()
#define min3(a, b, c) m... | 0 | 78,338,005 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = lon... | #include <bits/stdc++.h>
#define REP(i, x, n) for (int i = x; i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x.size())
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define uni... | 0 | 23,499,143 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
typedef long long LL;
using namespace std;
#define REPF( i , a , b ) for ( int i = a ; i <= b ; ++ i )
#define REP( i , n ) for ( int i = 0 ; i < n ; ++ i )
#define CLEAR( a , x ) memset ( a , x , sizeof a )
const int N=1e7;
int s... | #include <bits/stdc++.h>
#include <numeric>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define rep1(i,n) for (int i = 1; i <= n; ++i)
template<typename T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } retu... | 0 | 22,045,563 |
#include <iostream>
#include <math.h>
#include <algorithm>
#include <string>
#include <map>
#include <vector>
using namespace std;
void b_triple_dots(void) {
int k;
string s;
cin >> k >> s;
if (s.size() <= k) {
cout << s << endl;
return;
}
cout << s.substr(0, k) << "..." << endl;
}
int main()
{
b_triple_d... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll MOD=1000000007;
int main() {
int N; cin>>N;
ll C,K; cin>>C>>K;
vector<ll> T(N,0);
for(int i=0;i<N;i++){
cin>>T[i];
}
sort(T.begin(),T.end());
ll ans=0;
ll count=0;
ll saisyo=0;
for(int i=0;i<N;i++)... | 0 | 8,201,973 |
#include <bits/stdc++.h>
using namespace std;
int main () {
int n ; cin >> n;
set <string> a;
bool g = 1;
string s; cin >> s;
a.emplace(s);
char l = s[s.size() - 1];
for (int i = 1; i < n; i++) {
cin >> s;
if ((s[0] != l) || (a.count(s)))
g = 0;
l = s[s.s... | #include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<cstring>
#include<queue>
#include<stack>
#include<numeric>
using namespace std;
#define INF (1 << 30) - 1
#define LINF 1LL << 60
const int MOD = 1000000007;
using ll = long long;
using P = pair<int, int>;
int d... | 0 | 5,462,462 |
#include <bits/stdc++.h>
#define pb push_back
#define ll long long
#define mp make_pair
#define inf 1000000007
#define LINF 1000000000000000007LL
#define ll long long
using namespace std;
int dp[1<<26];
int val[214514];
int ans[214514];
signed main(){
string str;
cin>>str;
int n = str.size();
for(int i=1;i<=n;i++){... | #include <bits/stdc++.h>
#include <algorithm>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#include <numeric>
using namespace std;
int main() {
double n,d;
cin >> n >> d;
vector<vector<int>> data(n, vector<int>(d));
rep(i,n) {
rep(j,d) {
cin >> data.at(i).at(j);
}
}
int cou... | 0 | 69,386,087 |
#include<bits/stdc++.h>
using namespace std;
#define REP(i,s,n) for(int i=s;i<n;++i)
#define rep(i,n) REP(i,0,n)
#define SORT(c) sort((c).begin(),(c).end())
#define IINF INT_MAX
#define LLINF LLONG_MAX
#define DEBUG false
typedef long long ll;
typedef pair<int, int> ii;
#define MAXI 1000000
int main() {
string s;
whi... | #include<iostream>
using namespace std;
int k[200000+5];
int s1[200000+5];
long long s[200000+5],ans;
int mid;
bool check(int mid,int l){
return (s1[mid]^s1[l-1])==(s[mid]-s[l-1]);
}
int main(){
int n;
cin>>n;
for(int i=1;i<=n;i++){
cin>>k[i];
}
for(int i=1;i<=n;i++){
s[i]=s[i-1]+k[i];
}
for(int i=1;i<=n;i+... | 0 | 23,868,210 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 10000000... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define rep(i, m, n) for (lli i = m; i < (n); i++)
#define repe(i, m, n) for (lli i = m; i <= (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((lli)(x).size())
#define MAX(x) *max_element(ALL(x))
#... | 0 | 4,961,173 |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define REP(i,n) for(int i=0;i<n;i++)
#define REPP(i,n) for(int i=1;i<=n;i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define EPS (1e-9)
#define INF (1e17)
#define PI (acos(-1))
#define i_7 (long long)(1e9+7)
long mod(long a){
long long c=a%i_7;
if(c>=0)re... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i < (int)(n); i++)
using ull = unsigned long long;
using ll = long long;
using P = pair<int, int>;
int main() {
int s;
cin >> s;
bool exist[1000001] = {};
int ai = s, ans = 1;
while (exist[ai] == false) {
exist[ai]... | 0 | 47,843,810 |
#include <iostream>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
if(a == b) {
cout << "a == b\n";
} else if(a > b) {
cout << "a > b\n";
} else {
cout << "a < b\n";
}
return 0;
} | #include "bits/stdc++.h"
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define FOR(i, a) for (auto &i : a)
#define ALL(obj) begin(obj), end(obj)
#define MAX(x) *max_element(ALL(... | 0 | 51,466,193 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, D;
cin >> N >> D;
vector<vector<int>> A(N, vector<int>(D));
for (int i = 0; i < N; i++) {
for (int j = 0; j < D; j++) cin >> A[i][j];
}
int cnt = 0;
for (int i; i < N; i++) {
for (int j = i + 1; j < N; j++) {
int total = 0;
... | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#define ll long long
#define ull unsigned long long
#define ld long double
#define f(i,n) for(i=0;i<n;i++)
#define F(i,n) for(i=n-1;i>=0;i--)
#define fa(i,a,b) for(i=a;i<=b;i++)
#define Fa(i,a,b) for(i=a;i>=b;i--)
#define printArray(i,a,n) f(i,n)co... | 0 | 63,009,326 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rep1(i, n) FOR(i, 1, n+1)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define whole(x) (x).begin(),(x).end()
#define rwhole(x) (x).rbegin(), (x).rend()
#... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using Graph=vector<vector<int>>;
#define MAX 1000000
#define MOD 1000000007
#define INF 1000000000
int main(){
int M,K;
cin>>M>>K;
if((1<<M)<=K){
cout<<-1<<endl;
}else if(M>1){
cout<<K<<" ";
for(int i=0;i<(1<<M);i++){
if(i==K){
... | 0 | 7,016,770 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(int i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = ve... | #include <bits/stdc++.h>
using namespace std;
int main() {
int m, k;
cin >> m >> k;
if (k == 0) {
for (int i=0; i<(1<<m); ++i) {
cout << i << ' ' << i << ' ';
}
cout << endl;
} else if (m == 1 || (1<<m) <= k) {
cout << -1 << endl;
} else {
cout << 0 << ' ' << k << ' ' << 0 << ' ';
... | 0 | 92,216,782 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int AB = A * B;
if (AB % 2 == 0){
cout << "Even" << endl;
}
else {
cout << "Odd" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
#define bg begin(... | 0 | 3,746,393 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
int n,i,j;
cin >> n;
vector<int> a(n),b(n);
for(i=0;i<n;i++){
cin >> a.at(i);
}
j=0;
for(i=n-1;i>=0;i=i-2){
b.at(j)=a.at(i);
j++;
}
j=n-1;
for(i=n-2;i>=0;i=i-2){
b.at(j)=a.at(i);
j--;
}
for(i=0;i<n;... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
using namespace std;
struct Match {
int n;
vector<vector<int>> G;
vector<bool> used;
vector<int> match;
Match(int n_) : n(n_) { G.resize(n); }
void add_edge(int u, int v) {
G[u].push_back(v);
G[v].push_b... | 0 | 52,967,885 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.