code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const double EPS = 1e-10;
const int INF = 1e9;
const ll LINF = 1e15;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,... | #include<iostream>
#include<stdio.h>
//#include <bits/stdc++.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<cassert>
#include<cmath>
#include<cstdint>
... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int ara[n];
for(int i=0;i<n;i++) cin >> ara[i];
for(int i=n-1;i>=1;i--) cout << ara[i] << " ";
cout << ara[0] << endl;
return 0;
}
| #include <cstdio>
//#include <iostream>
//#include <string>
using namespace std;
// cl /EHsc xxx.cpp
int main(int argc, char *argv[])
{
int n;
scanf("%d", &n);
int *ary = new int[n];
int v;
int t = n;
while (t)
{
scanf("%d", &v);
ary[--t] = v;
}
for (int j = 0; j < n; j++)
{
printf((j == n-1) ? ... | 1 |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <algorithm>
#include <cstdio>
#include <iomanip>
#include <queue>
#include <deque>
#include <stack>
#include <fstream>
#include <cmath>
#include <random>
#define ll int64_t
#define Rep(i, n) for (ll i = 0;... | #include <bits/stdc++.h>
#define PI 3.14159265358979323846264338327950288419
using namespace std;
int n, m;
int pref[303][303];
int ptr[303];
int freq[303];
queue<int> Q;
bool die[303];
void incre(int j, int c){
// printf(" ++%d\n", j);
freq[j]++;
if(freq[j] == c + 1){
// printf("c = %d, die %d\n", c, j);
d... | 1 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <utility>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <cstdio>
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rep2(i,s,t) for(int i = s; i <= t; ++i)
#def... | #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>;
int main() {
int n;
cin >> n;
vector<ll> a(n);
int cnt = 0, cnt_z = 0;
rep(i,0,n) {
cin >> a[i];
if (a[i] < 0) cnt++;
else if (a[i] == 0) cnt_z++;
}
ll... | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n, a;
while(cin >> n, n){
n++;
vector<int> t(n);
t[0] = 0;
for(int i = 1;i < n;i++){
cin >> a;
t[i] = max(t[i-1]+a, a);
}
cout << *max_element(t.begin()+1, t.end()) << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rep2(i, a, b) for (ll i = (a); i < (b); i++)
#define chmax(x, v) \
do { \
x = max(x, v); ... | 0 |
#include<bits/stdc++.h>
using namespace std ;
// MY TOOLS
#define let long long int
#define async ios_base::sync_with_stdio(false);cin.tie(NULL);
//
int dp[10001][101][2] ;
int mod = 1e9 + 7 ;
void self_add( int &a, int b ){
a += b ;
if( a >= mod ) a -= mod ;
}
int SIZE ;
int generate_top_down( string num, int id... | #include <bits/stdc++.h>
using namespace std;
/* typedef */
typedef long long ll;
typedef pair<int, int> pii;
/* constant */
const int mod = 1e+9 + 7;
/* global variables */
/* funciton */
/* main */
int main() {
string S;
int D;
cin >> S >> D;
vector<int> a(S.size());
for (int i = 0; i < S.size(); ... | 1 |
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include <random>
#include... | #pragma GCC optimize("O2,Ofast,inline,unroll-all-loops,-ffast-math")
#pragma GCC target("popcnt")
#include <bits/stdc++.h>
#define maxn 2010
#define maxv 4000010
#define ll long long
#define ull unsigned long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define pob pop_back
#defin... | 0 |
#include<bits/stdc++.h>
#define ll long long int
#define vec vector<ll>
#define mat vector<vector<ll>>
using namespace std;
const ll mod=1000000007;
const ll inf=LONG_LONG_MAX;
ll dx4[4]={1,0,-1,0};
ll dy4[4]={0,-1,0,1};
ll dx8[8]={1,0,-1,1,-1,1,0,-1};
ll dy8[8]={1,1,1,0,0,-1,-1,-1};
int main(){
ll n;
cin >> n;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
int N;
cin >> N;
cout << N/3 << endl;
return 0;
} | 1 |
#include <iostream>
#include <string>
using namespace std;
int main()
{
int month[]={0,31,29,31,30,31,30,31,31,30,31,30,31};
int m,day,sumday;
while(1){
cin >> m; // 月
if (m==0){ break;}
cin >> day; //日付
for(int i=0;i<m;i++){
day+=month[i];
}
switch(day%=7){
case 1:
cout<<"Thursday"<<endl;... | #include <iostream>
#include <cstdio>
using namespace std;
string name[] = {"Sunday", "Monday", "Tuesday", "Wednesday", "Thursday", "Friday", "Saturday"};
int dayOfWeek(int y, int m, int d) {
if(m == 1 || m == 2) {
y--;
m += 12;
}
return(y + y / 4 - y / 100 + y / 400 + (13*m + 8) / 5 + d) % ... | 1 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
cout << (N + 110) / 111 * 111 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
int main( ) {
//freopen("B.01.in","r",stdin);
... | 1 |
#include<iostream>
#include<string>
using namespace std;
class Cube{
public:
int f[6];
Cube(){}
void roll_z(){roll(1,2,4,3);}
void roll_y(){roll(0,2,5,3);}
void roll_x(){roll(0,1,5,4);}
void roll(int i,int j,int k, int l){
int t=f[i];f[i]=f[j];f[j]=f[k];f[k]=f[l];f[l]=t;
}
void move(char ch){
... | #include <iostream>
#include <unordered_map>
#include <vector>
using namespace std;
/* Articulation Points (Critical Routers) */
int timer = 0;
void getAP(unordered_map<int,vector<int>*>& adjacencyList, unordered_map<int,int>& d, unordered_map<int,int>& l, unordered_map<int,int>& p, unordered_map<int,bool>& visited, i... | 0 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
int main() {
ll A, B, C, D;
cin >> A >> B >> C >> D;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
a = a + b - c - d;
if (a > 0) cout << "Left";
if (a < 0) cout << "Right";
if (a == 0) cout << "Balanced";
} | 1 |
#include <stdio.h>
int main(void)
{
int a,b=0,c=0,e,d,f,i,j,team[10000]={0},k[100]={0};
scanf("%d",&a);
for(i=0;i<a-1;i++){
for(j=i;j<a-1;j++){
b++;
}
}
for(i=0;i<b;i++){
scanf("%d %d %d %d",&c,&d,&e,&f);
if(e>f){
team[c]=team[c]+3;
}
else if(f>e){
team[d]=team[d]+3;
}
else{
team[c]=tea... | #include <iostream>
#include <vector>
using namespace std;
int main(){
int N;
int p[100], order[100];
int a,b,c,d;
vector<int> v;
cin >> N;
for( int i=0;i<N;i++ ) p[i]=0;
for( int i=0,len=N*(N-1)/2;i<len;i++ ){
cin >>a >> b >> c >> d;
// cout << a<<b<<c<<d<<endl;
a--; b--;
if( c==d ){... | 1 |
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<char> VC;
typedef vector<double> VD;
typedef vector<string> VS;
typedef vector<ll> VLL;
typedef vector<PLL> VP;
const static int INF = 1000000000;
const stati... | #include <iostream>
using namespace std;
int main() {
int n;
long long a, b;
long long xi, x;
long long ans=0;
cin >> n >> a >> b;
cin >> x;
for (int i =0; i < n-1; ++i) {
cin >> xi;
if (a*(xi - x) > b)
ans += b;
else
ans += a*(xi-x);
... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = (1 << 17) + 10;
const int mod = 1e9 + 7;
int n, x, y, z, ans;
int lim, Haiku, dp[45][N];
ll PowMod(ll a, ll b) {
ll res = 1 % mod;
while(b) {
if(b & 1) res = res * a % mod;
a = a * a % mod;
b >>= 1;
}
return res;
}
int mai... | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n)... | 0 |
#include<stdio.h>
int main(){
char a[100];
scanf("%[^\n]", a);
int ctr = 0;
for(int i= 0; a[i] != '\0'; i++){
if(a[i] == ' '){
if(a[i - 1] == a[i + 1]){
ctr++;
}
}
}
if(ctr == 2){
printf("YES\n");
}
else{
printf("NO\n");
}
return 0;
} | #include <iostream>
#include <cmath>
#include <algorithm>
#include <bitset>
#include <iomanip>
#include <cstdio>
#include <new>
#include <vector>
#include <cstdlib>
#include <string>
#include <set>
#include <tuple>
#include<map>
using namespace std;
int main() {
string A, B, C;
cin >> A >> B >> C;
bool ans = true;... | 1 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
#define pb push_back
using namespace std;
typedef long long ll;
int n,k;
int f(int x,vector<int>v){
int ans=0;
for(int i=min(x-1,n-1);i>=0;i--){
int res=0;
int p=x-1-i;
vector<int> t(i+1);
rep(j,i+1) t[j]=v[j];
sort(t.begin(),... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
string s;
cin >> s;
int cnt=0;
for(int i=1; i<n; i++){
if(s.at(i) == 'E') cnt++;
}
vector<int> change(n);
change.at(0) = cnt;
for(int i=1; i<n; i++){
change.at(i) = ... | 0 |
#include<bits/stdc++.h>
#define ll long long
#define inf(x) (ll)(1e##x)
using namespace std;
template<typename tn> void read(tn &a){
tn x=0,f=1; char c=' ';
for(;!isdigit(c);c=getchar()) if(c=='-') f=-1;
for(;isdigit(c);c=getchar()) x=x*10+c-'0';
a=x*f;
}
int n,m;
vector<int> v[3];
int main(){
read(n);read(m);
fo... | #include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
int sum, n;
int a[101], odd, evn, pos[101];
int b[101], cnt;
void work()
{
if(n == 1)
{
if(a[1] == 1) b[++cnt] = 1;
else b[++cnt] = 1, b[++cnt] = a[1] - 1;
return;
}
if(a[1] & 1) b[++cnt] = a[1] + 1;
else b[... | 1 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll,ll>;
using vl = vector<ll>;
using Map = map<ll,ll>;
using T = tuple<ll,ll,ll>;
using vvl = vector<vector<ll>>;
#define all(v) v.begin(), v.end()
#define prt(v) cout<<(v)<<"\n";
#define fi(v) get<0>(v)
#define se... | #include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp> // Common file
//#include <ext/pb_ds/tree_policy.hpp>
//#include <functional> // for less
#define PI acos(-1.0)
#define eps 1e-9
#define ll long long
#define ull unsigned long long
#define nl printf("\n")
#define sf scanf
#define pf printf
#define INF ... | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=2e5+5;
int a[maxn],b[maxn];
int main(){
int n;
vector<int>p;
cin>>n;
for(int i=1;i<=n;++i)scanf("%d",&a[i]);
for(int i=1;i<=n;++i)scanf("%d",&b[i]);
reverse(b+1,b+n+1);
int h1=n,q1=1,mx;
for(int i=1;i<=n;... | #include<bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef long double louble;
template<typename T1,typename T2> inline T1 max(T1 a,T2 b){return a<b?b:a;}
template<typename T1,typename T2> inline T1 min(T1 a,T2 b){return a<b?a:b;}
namespace ae86
{
const int bufl = 1<<15;
char buf[bufl],*s=buf,*... | 0 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
bool check(int n){
double rn=sqrt(n);
if(rn==(int)rn)return true;
else return false;
}
int main(){
int n;
cin >> n;
rep(i,n){
if(check(n-i)){
cout << n-i << endl;
return 0;
}
}
cout << 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
using P = pair <int, int>;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return tru... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
map<int, int> mp;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
mp[x] += 1;
}
vector<int> ans;
for (auto p : mp) {
if (p.second >= 4) {
ans.push_back(p.first);
ans.push_back(p.first);
} else if (p... | #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair <int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> ... | 1 |
#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
type... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fr(i,j,k) for(int i=j;i<k;i++)
#define f(n) fr(i,0,n)
#define f1(n) fr(i,1,n+1)
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
const int mod = 1e9 + 7;
const int maxn = 100005;
ll val[1<<16];
ll dp[1<<16]... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll powll(ll b, int e) {
ll result = 1;
while (e) {
if (e & 1) {
result *= b;
}
b *= b;
e >>= 1;
}
return result;
}
bool is_palindrome(const string &s) {
int N = s.size();
int i = 0... | //Author- Vaibhav Singh
#include<bits/stdc++.h>
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_multiset tree<long long , null_type,less_equal<long long >, rb_tree_tag,tree_order_statistics_node_update>
#define ordered_set tree<long long , n... | 1 |
#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;
#define MAX 2000000
#define MOD 1000000007
int main(){
int N,M;
cin>>N>>M;
vector<int> A(M);
for(int i=0;i<M;i++){
cin>>A.at(i);
}
sort(A.begin(),A.end());
reverse(A.begin(),A.end());
int match[9]={2,5,5,4,5,6,3,7,6};
vector<int>... | 1 |
#include<iostream>
using namespace std;
int main(){
int x, y, z;
cin >> x >> y >> z;
swap(x, y);
swap(x, z);
cout << x << " " << y << " " << z;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int N = 220000;
vector<int> con[N];
int root[N];
inline int find_root(int u) {
if (u == root[u]) return root[u];
return root[u] = find_root(root[u]);
}
int vis[N];
vector<int> cur;
void dfs(int u) {
vis[u] = 1;
cur.push_back(u);
for (int v : con[u]) if (!vis[... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define INF 1000000007
int main()
{
string s1,s2,s3;
cin>>s1>>s2>>s3;
ll a = 0,b = 0,c = 0;
string ch = "a";
while(1)
{
if(ch == "a")
{
if(s1.size()>a)
{
ch = s1[a];
a++;
}
else
{
cout<<"A"<<endl;
retur... | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("unroll-loops")
//#pragma warning(disable : 4996)
//#include"atcoder/all"
#ifdef _MSC_VER
#include <intrin.h>
#define __builtin_popcount __popcnt
#define __builtin_popcountll __popcnt64
#endif
#incl... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var << "] " ... | #include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <unordered_map>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
#include <unordered_map>
#include <fstream>
using namespac... | 1 |
#include <stdio.h>
#include <iostream>
using namespace std;
int main() {
int n;
int kaisu;
int team[100][3] = {0};
int teamn[100];
int a,b,c,d;
int kari;
int juni = 1;
int counter = 1;
cin >> n;
kaisu = n * (n - 1) / 2;
for (int i = 0; i < n; i++) {
team[i][0] = i;
}
for (int i = 0; i < kaisu; i++... | #include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
typedef pair<int,int> P;
const int MAX = 120;
int maze[MAX][MAX];
bool come[MAX][MAX];
P s,g;
int W,H,c;
int dx[4] = {1,0,0,-1};
int dy[4] = {0,1,-1,0};
void init(){
memset(come,false,sizeof(come));
memset(maze,0,sizeof(maze));
}
vo... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REPR(i,n) for(int i=n; i>-1; --i)
#define ALL(a) (a).begin(),(a).end()
#define FILL(a,n,x); REP(i,(n)){ (a)[i]=(x); }
#define CINA(a,n); REP(i,(n)){ cin >> (a)[... | // ░░░░░░░░( •̪●)░░░░░░░░░░░░░░░░░░░░░░░░
// ░░░░░░███████ ]▄▄▄▄▄▄▄▄▃░░░▃░░░░ ▃░
// ▂▄▅█████████▅▄▃▂░░░░░░░░░░░░░░░░░
// [███████████████████].░░░░░░░░░░░░░░
// ◥⊙▲⊙▲⊙▲⊙▲⊙▲⊙▲⊙◤...░░░░░░░░░░░░
//PointBlank's code (⌐■_■)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
ll po... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100005;
vector<int> to[MAXN];
vector<int> d1(MAXN, -1), d2(MAXN, -1);
void dfs(int u, int path, vector<int> &d)
{
if (d[u] != -1)
{
return;
}
d[u] = path;
for (auto v : to[u])
{
dfs(v, path + 1, d);
}
}
int main()
{
int N, u, v, a,... | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#de... | 0 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<iomanip>
using namespace std;
int main(){
int a,b,c,d,e,k;
cin>>a>>b>>c>>d>>e>>k;
if(e-a<=k)cout<<"Yay!"<<endl;
else cout<<":("<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | 0 |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx2,tune=native")
#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("trapv")
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//using namespace __gnu_pbds;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pb pu... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
string s;
vector<pair<ll,ll> > p;
for(ll i=0; i<n; i++) {
cin >> s;
ll x=0, d=0;
for(ll j=0; j<(ll)s.size(); j++) {
if (s[j]=='(') x++;
i... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//マクロ
//forループ関係
//引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
//Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#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 FOR(i,a,b) for(ll i=a;i<=(ll)(b);i+... |
#include <bits/stdc++.h>
using namespace std;
#define M 1000000007
#define pb push_back
#define mp make_pair
#define s second
#define f first
#define mod 998244353
#define sz(v) (int)(v).size()
#define pii pair<int, int>
#define vi vector<int>
#define ll long long
#define fastio ios_base::sync_with_stdio(false);cin... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
template<typename T1,typename T2> bool chmin(T1 &a,T2 b){if(a<=b)return 0; a=b; return 1;}
template<typename T1,typename T2> bool chmax(T1 &a,T2 b){if(a>=b)return 0; a=b; return 1;}
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
... | /* 実行時間1s制限の場合10^6 1,000,000 : 余裕をもって間に合う10^7
10,000,000 : おそらく間に合う10^8 100,000,000 : 非常にシンプルな処理
でないと厳しい
*/
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#include <bits/stdc++.h>
#define M_PI 3.14159265358979323846
using namespace std;
typedef long long ll; /... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
typedef long long ll;
#define all(x) (x).begin(),(x).end()
int main(){
ll n; cin>>n;
vector<ll> v(5);
rep(i,5) cin>>v[i];
sort(all(v));
cout<<(n+v[0]-1)/v[0]+4<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t N;
cin >> N;
int64_t minimum;
for(int i = 0; i < 5; i++) {
if(i == 0) {
cin >> minimum;
}
else {
int64_t a;
cin >> a;
minimum = min(minimum, a);
}
}
cout << (N - 1) / minimum + 5 << endl;
} | 1 |
#include <iostream>
#include <algorithm>
#include <iomanip>
double avg(int n) {
return (n+1)/2.0;
}
int main() {
int n, k, p[2000010];
std::cin >> n >> k;
for (int i = 0; i < n; ++i)
std::cin >> p[i];
double sum = 0;
for (int i = 0; i < k; ++i) {
sum += avg(p[i]);
}
double ans = sum;
for (int i = k; ... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N,K; cin>>N>>K;
vector<int>A(N);
vector<long double>sum(N+K);
for(int i=0;i<N;i++){
cin>>A[i];
sum[i]+=A[i]+1;
sum[i+K]-=A[i]+1;
}
for(int i=1;i<N+K;i++)sum[i]+=sum[i-1];
sort(sum.begin(),sum.end());
cout<<fixed<<setprecision(10)<... | 1 |
#include <stdio.h>
#include <string.h>
#include <string>
#include <iostream>
#include <vector>
#include <sstream>
#include <memory>
#include <iomanip>
std::vector<int> parse_line(std::string const& line) {
using namespace std;
vector<int> result;
istringstream s(line);
string element;
while (getlin... | #include <iostream>
#include <cstdio>
#include <string>
using namespace std;
int main()
{
int data[10][10];
int n;
while (cin >> n, n) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> data[i][j];
}
}
int ans;
for ... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m,mx=0,mn=999999;
cin>>n>>m;
vector<pair<int,int>> v(m);
for(int i=0;i<m;i++){
cin>>v[i].first>>v[i].second;
mx=max(v[i].first,mx);
mn=min(v[i].second,mn);
}
cout<<max(mn-mx+1,0);
return 0;
}
| #include<bits/stdc++.h>
using ll = long long;
using namespace std;
const ll INF = 10000000000000000;
const ll mod = 1000000007;
//printf("%.10f\n", n);
ll n, W; ll w[345678], v[345678], dp1[5000][23456], dp2[5000][23456];
void solve1() {
for (int i = 0; i < n; i++) {
for (int j = 0; j <= W; j++) {
if (i == 0) {
... | 0 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const ll N=1e5+5;
ll n;
vector< pair<ll,ll> > adj[N];
vector< pair< pair<ll,ll> , ll > >wt;
bool cmp( pair< pair<ll,ll> , ll > a,pair< pair<ll,ll> ,ll >b){
return a.second<b.second;
}
ll par[N],sz[N];
void init(){
for(ll i=0;i<N;i++)par[i]=i,sz... | #include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
typedef long long ll;
typedef long double ld;
const int N = (int) 1e6 + 7;
int n, sumtop;
struct T {
int top;
int mn;
};
bool cmp1(T a, T b) {
return a.mn > b.mn;
}
bool cmp2(T a, T b)... | 0 |
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main(){
int m,n;
while(cin>>n>>m,n){
int plz[1050]={0},total=0,cnt=1;
for(int i=0;i<n;i++){
cin>>plz[i];
}
sort(plz,plz+n);
reverse(plz,plz+n);
for(int i=... | #include <iostream>
using namespace std;
int sum,h,w,a,b;
int main(){
while(1){
cin >> h>>w;
if(!(h||w))break;
sum=h*h+w*w;
a=h+1;
while(1){
while(a*a<sum){
b=a+1;
while(a*a+b*b<=sum){
if(a*a+b*b==sum)goto END;
b++;
}
a++;
}
sum++;
a=1;
}
END:;
cout <<a <<" " <<b <... | 0 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main()
{
int N; cin >> N;
ll ans = 0;
int k;
ll r... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> p_ll;
typedef vector<pair<ll, ll>> vec_p; //vector<pair<ll, ll>> pairs(n) ,pairs.at(i) = make_pair(i*i, i)
const ll MOD = pow(10, 9) + 7;
const ll LLINF = pow(2, 61) - 1;
const int INF = pow(2, 30) - 1;
int main()
{
ios:... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int y,z;
cin>>y>>z;
if(y%z==0) cout<<0<<endl;
else cout<<1<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (int)1e9+7
#define rep(i,a,b) for(int i=a;i<b;++i)
#define rrep(i,a,b) for(int i=a;i>b;--i)
#define vi vector<int>
#define vl vector<ll>
#define ld long double
#define vvi vector<vector<int>>
#define vvl vector<vector<long long>>
#define... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int A,B,C,D,a;
cin>>A>>B>>C>>D;
a=min(min(min(A+C,A+D),B+C),B+D);
cout<<a<<endl;
} | #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 <iostream>
#include <cstring>
#include <string>
#include <cstdlib>
#include <queue>
#include <set>
#include <algorithm>
using namespace std;
const int MAXN = 100005;
const int MAXE = 200005;
const int NIL = -1;
typedef long long ll;
const ll INF = 0x3f3f3f3f3f3f3f3f;
bool vis[MAXN];
struct Edge {
int to, nex... | // https://atcoder.jp/contests/abc106/tasks/abc106_d
#include <bits/stdc++.h>
using namespace std;
// #define int long long
#define REP(i, n) FOR(i, 0, n)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end... | 0 |
#include <iostream>
#include <stdlib.h>
#include <string.h>
using namespace std;
int main() {
string x;
cin >> x;
for (int j = 97; j <= 122; j++) {
bool a = 0;
for (int i = 0; i < x.size(); i++) {
if (char(j) == x[i]) {
a = 1;
continue;
... | #include<iostream>
#include<vector>
using namespace std;
string in;
vector<string> V;
string change(string in){
for(int i = 0; i < in.length(); i++){
if(in[i] != 'a') in[i]--;
else in[i] = 'z';
}
return in;
}
string solve(){
int status = 0;
while(1){
for(int i = 0; i < V.size(); i++){
stri... | 0 |
// #define _GLIBCXX_DEBUG
#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 deb... | #include <bits/stdc++.h>
#define int long long
#define x first
#define y second
#define getbit(x, i) (((x) >> (i)) & 1)
using namespace std;
typedef pair<int, int> pii;
#define hashset unordered_set
#define hashmap unordered_map
#define newline fast_writechar('\n')
#define unify(arr) arr.resize(unique(arr.begin(), arr.... | 0 |
#include <bits/stdc++.h>
using namespace std;
//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var << "] " ... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); ++i)
double const PI = 3.1415926535897932384626433;
int main() {
int a, b, c, d, e, k;
cin >> a >> b >> c >> d >> e >> k;
if (e - a <= k) {
cout << "Yay!" << endl;
} else {
cou... | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> A(5);
for(int i=0; i<5; i++) cin >> A.at(i);
int k, ans=0;
cin >> k;
for(int i=0; i<5; i++) {
for(int j=i+1; j<5; j++) {
if(A.at(j) - A.at(i) > k) ans = 1;
}
}
if(ans == 0) cout << "Yay!" << endl;
else cout << "... | 1 |
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
// output
#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n' : ' ');
#define YES cout <... | #pragma GCC optimize ("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse4")
#include"bits/stdc++.h"
using namespace std;
typedef long long ll;
#define int ll
#define sz(x) (int)(x).size();
#define all(x) x.begin(), x.end()
#define trav(i,a) for(auto &i:a)
inline int in(){int x;scanf("%lld",&x);return x... | 0 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int,int>
#define space putchar(' ')
#define enter putchar('\n')
#define mp make_pair
#define pb push_back
//#define ivorysi
#define MAXN 300005
using namespace std;
typedef long long int64;
typedef double db;
template<class T>
void read(T &res... | #ifndef VS
#include<bits/stdc++.h>
#endif
using namespace std;
typedef long long LL;
#ifdef BTK
#define DEBUG if(1)
#else
#define CIN_ONLY if(1)
struct cww {cww() {CIN_ONLY{ios::sync_with_stdio(false); cin.tie(0);}}
}star;
#define DEBUG if(0)
#endif
#define ALL(v) (v).begin(),(v).end()
#define REC(ret, ...) std::fun... | 1 |
using namespace std;
#include <iostream>
#include <vector>
int A,B,C;
int main() {
cin >> A >> B >> C;
string ans = (A < C) ^ (B < C)?"Yes":"No";
cout << ans << endl;
return 0;
} | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<cmath>
#include<stdio.h>
#include<queue>
#include <climits>
#include <map>
#include <set>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int mod = 1e9 + 7;
const long long INF = 1LL << 60;
int main()
{
int... | 0 |
#include<iostream>
#include<cstdio>
using namespace std;
char s[20][20];
int ans,dx[]={0,0,1,-1},dy[]={1,-1,0,0};
void func(int y,int x){
s[y][x]='0';
int q,p;
for(int i=0;i<4;i++){
q=x+dx[i];
p=y+dy[i];
if(q>=0&&q<12&&p>=0&&p<12){
if(s[p][q]=='1')
func(p,q);
}
}
}
int main(){
while(cin>>s[0]){
a... | #include <iostream>
#include <utility>
static int bsort(int *a, int n) {
bool f = true;
int c = 0;
while (f) {
f = false;
for (int i = n - 1; i > 0; --i) {
if (a[i] < a[i - 1]) {
std::swap(a[i], a[i - 1]);
f = true;
++c;
... | 0 |
// 解き直し.
// https://img.atcoder.jp/cf17-final/editorial.pdf
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using P = pair<LL, LL>;
#define pb push_back
#define a first
#define b second
#define repx(i, a, b) for(int i = a; i < b; i++)
#define rep(i, n) repx(i, 0, n)
#define repr(i, a, b) for(int i =... | /**
* author: tourist
* created: 22.01.2020 00:01:26
**/
#include <bits/stdc++.h>
using namespace std;
class dsu {
public:
vector<int> p;
int n;
dsu(int _n) : n(_n) {
p.resize(n);
iota(p.begin(), p.end(), 0);
}
inline int get(int x) {
return (x == p[x] ? x : (p[x] = get(p[x]))... | 0 |
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 110;
int n, m, ex, ey;
int dp[2][MAXN][MAXN][MAXN];
int C[MAXN][MAXN], R[MAXN][MAXN];
char s[MAXN][MAXN];
inline int QR(int p, int l, int r) {
if(l >= r) return 0;
return R[p][r]-R[p][l];
}
inline int QC(int p, int l, int r) {
if(l >= r) return 0;
ret... | #include <iostream>
#include <vector>
#include <deque>
#include <algorithm>
#include <numeric>
#include <string>
#include <cstring>
#include <list>
#include <unordered_set>
#include <tuple>
#include <cmath>
#include <limits>
#include <type_traits>
#include <iomanip>
#include <map>
#include <unordered_map>
#include <que... | 0 |
#include <bits/stdc++.h>
#define ri register
#define int long long
#define E (n+1)
using namespace std; const int N=200010;
inline int read()
{
int s=0, w=1; ri char ch=getchar();
while(ch<'0'||ch>'9') { if(ch=='-') w=-1; ch=getchar(); }
while(ch>='0'&&ch<='9') s=(s<<3)+(s<<1)+(ch^48), ch=getchar();
ret... | #include<iostream>
using namespace std;
int main()
{
int n;
cin >> n;
if(n / 3. >= 1)
cout << n / 3;
else cout << 0;
return 0;
}
| 1 |
#include<iostream>
#include<string.h>
using namespace std;
int main(){
string str;
cin>>str;
for(int i=0;i<str.length();i++)
cout<<str[str.length()-i-1];
cout<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll, vl/*, greater<ll>*/> pql; //降順(/*昇順*/)
typedef set<ll> sl;
typedef pair<ll, l... | 0 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
using namespace std;
#define ENDL "\n"
typedef long long int llint;
int intinput()
{
int x;
scanf("%d", &x);
return x;
}
llint dp[300][300 * 300 + 1];
void code()
{
llint MOD = 998244353;
int N = intinput();
vector<int> a(N);
f... | #include <bits/stdc++.h>
using namespace std;
const int N = 305;
const int S = N * N;
const int mod = 998244353;
void add(int &x,int y) {
x += y;
if (x >= mod) x -= mod;
}
void sub(int &x,int y) {
x -= y;
if (x < 0) x += mod;
}
int mul(int x,int y) {
return (long long) x * y % mod;
}
int a[N];
int f[S],... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
reverse (s.begin(),s.end());
cout<<s<<endl;
return 0;
}
| //Reverse Sequence
#include<bits/stdc++.h>
using namespace std;
int main(){
char str[21];
scanf("%s", str);
for(int i=0; i<strlen(str); i++){
printf("%c", str[strlen(str)-i-1]);
}
puts("");
return 0;
} | 1 |
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<vector>
#include<queue>
#include<bitset>
#include<string>
#include<stack>
#include<set>
#include<unordered_set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<complex>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<algorithm>... | #include <bits/stdc++.h>
#define ll long long
#define maxn 100005 /*rem*/
#define mod 998244353
#define db double
#define vi vector<int>
#define pb push_back
#define mp make_pair
#define pi pair<int, int>
#define fi first
#define se second
using namespace std;
int a[maxn];
int n, m;
int f[maxn], cnt = 0;
bool cmp(int a... | 0 |
#include<iostream>
#include<cmath>
#include <iomanip>
using namespace std;
int main() {
long double n,m,x,y,w,z;
cin >> x>>y>>w>>z;
n = x-w;
m = y-z;
cout << setprecision(10) <<sqrt(n*n+m*m) << endl;
return 0;
}
| #include<cstdio>
#include<cctype>
#include<cstdlib>
#include<algorithm>
typedef signed long long int int64;
inline unsigned getint() {
register char ch;
while(!isdigit(ch=getchar()));
register unsigned x=ch^'0';
while(isdigit(ch=getchar())) x=(((x<<2)+x)<<1)+(ch^'0');
return x;
}
inline int64 min(const int64 &a,co... | 0 |
#include <iostream>
#include <limits>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n, a;
long long int mina, maxa, suma;
cin>>n>>a;
mina=maxa=suma=a;
for(int i=1; i<n; i++) {
cin>>a;
if(mina>a) mina=a;
if(maxa<a) maxa=a;
suma+=a;
}
cout<<mina<<' '<<maxa<<' '<<suma<<'... | #include <bits/stdc++.h>
using namespace std;
#define faster ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pi acos(-1.0)
#define nl '\n'
///Library
#define mem(a,b) memset(a,b,sizeof(a))
#define all(a) a.begin(),a.end()
#define Sort(x) sort(x.begin(),x.end())
#define ... | 0 |
#include<cstdio>
#include<iostream>
#include<string>
using namespace std;
int main(void){
string roman;
string fig("IVXLCDM");
int ure[]={1,5,10,50,100,500,1000};
int sum;
while(cin>>roman){
sum=0;
for(int i=1;i<roman.length();i++){
if(ure[fig.find(roman[i])]>ure[fig.find(roman[i-1])]) sum+=-1*ure[fig.fi... | #include <iostream>
using namespace std;
int gcd(int a, int b){
if(a < b) swap(a,b);
if(b == 0) return a;
else return gcd(b, a%b);
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int N; cin >> N;
if(N == 2){
int a, b;
cin >> a >> b;
for(int i = 1; i < max(a,b) ... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<vector<int>> Graph;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
... | #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(x) fixed << setprecision(x)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin()... | 0 |
#include <bits/stdc++.h>
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0, a1, a2, a3, a4, x, ...) x
#define dump_1(x1) cerr << #x1 << ": " << x1 << endl
#define dump_2(x1, x2) \
cerr << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << endl
#define dump_3(x1, x2, x3) \
ce... | // Aizu Vol-5 0533: Contest
// 2017.8.30 bal4u@uu
#include <stdio.h>
int max[2][3];
int main()
{
int i, j, p, s[2];
for (j = 0; j < 2; j++) {
for (i = 0; i < 10; i++) {
scanf("%d", &p);
if (p > max[j][0]) max[j][2] = max[j][1], max[j][1] = max[j][0], max[j][0] = p;
else if (p > max[j][1]) max[j][2... | 0 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
#define lol(i,n) for(ll i=0;i<n;i++)
#define mod 1000000007
typedef long long ll;
using namespace std;
#define X 610
ll n;
class Con{
public:
vector<pair<ll,ll> > g[X][X];
ll s[X][X];
void dfs(ll x,ll y,ll c){
if(~s[x][y]... | #include <bits/stdc++.h>
int read(){
int x=0,f=1;
char ch=getchar();
while (ch<'0' || ch>'9'){
if (ch=='-') f=-1;
ch=getchar();
}
while (ch>='0' && ch<='9'){
x=x*10+ch-'0';ch=getchar();
}
return x*f;
}
const int N=600;
int n,d1,d2,col[2][N*N];
std::vector< std::pair<int,int> > v[2];
inline int id(const int... | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <numeric>
#include <string>
#include <cstdio>
#include <cstring>
#include <queue>
#include <stack>
#include <set>
#include <cmath>
#include <bitset>
#include <iomanip>
using ll = long long;
using ull = unsigned long long;
using namespa... | #include <bits/stdc++.h>
using namespace std;
#define M 1000000007
long long int power(int a,int b)
{
if(b==0)
return 1;
long long int k=power(a,b/2);
if(b%2==0)
return ((k%M)*(k%M))%M;
else
return ((k%M)*(k%M)*(a%M))%M;
}
long long int fact(long long int n)
{
if(n==1 || n==0... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
#define all(x) (x).begin(), (x).end()
#define fsp(x) fixed << setprecision(x)
const ll inf = LLONG_MAX;
const long double pi = acos(-1);
void Yes() {cout << "Yes" << endl;}
void No() {cout << "No" << endl;}
void YES() {cout << "... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
main() {
int n;
cin>>n;
int arr[2*n];
for(int i=0; i<2*n; i++){
cin>>arr[i];
}
sort(arr, arr+2*n);
int sum=0;
for(int i=0; i<2*n; i=i+2){
sum+=arr[i];
}
cout<<sum;
return 0;
} | 0 |
#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
int N, K;
vector<int> A;
void simulate() {
int RUI[N + 1];
memset(RUI... | #include <bits/stdc++.h>
#define ll long long
#define str string
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
#define vc vector<char>
#define vvc vector<vc>
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define vvll vector<vll>
#define vvvll vector<vvll... | 0 |
#include<iostream>
#include<vector>
using namespace std;
const int MOD=1000000007;
void add(long long &a,long long b){a+=b;if(a>=MOD)a-=MOD;}
int H,W,K;
long long solve(){
--K;
vector<vector<long long> > dp(H+1,vector<long long>(W,0));
dp[0][0]=1;
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
typedef pair <int,int> P;
ll dp[105][10];
ll a[10][10];
const ll MOD=1e9+7;
int main(){
int h,w,k;
cin>>h>>w>>k;
for(int bit=0;bit<1<<w-1;bit++){
bool ok=true;
rep(i,w-2){
if((bit&1<<i)&&(bi... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define se second
#define fi first
const int N=2000005;
int n,m,tot,l,x,y,z,f[N],dis[N],to[N],ne[N],fi[N],zz[N],g[N];
vector<pair<int ,int> > G[N];
vector<int> v;
void jb(int x,int y){
ne[++tot]=fi[x];
fi[x]=tot;
zz[tot]=y;
}
int find(int x){
if (x==... | #include <bits/stdc++.h>
#define enter putchar('\n')
#define space putchar(' ')
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
typedef pair<int, int> pii;
map<pii, int> M;
vector<pii> E[500005];
set<pii> s;
int n, m, ncnt, d[500005];
template <class T> int read(T &x) {... | 1 |
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
typedef long long i64;
int D, len = 0;
i64 pw[20], result = 0;
void work(int x, int L, i64 rest, i64 way) {
if (x == L / 2) {
if (rest == 0) result += way * ((L & 1) ? 10 : 1);
return;
}
if ((L & 1) && x == L / 2) {
... | #include<bits/stdc++.h>
#define fo(i,a,b) for(i=a;i<=b;i++)
#define fd(i,a,b) for(i=a;i>=b;i--)
#define min(a,b) (a<b?a:b)
#define max(a,b) (a>b?a:b)
typedef long long ll;
using namespace std;
int d,k,L,i,j,ten[15],a[25];
int s[25],mx,f[25];ll ans,an;
void dfs(int x,ll now){
if (L-x>=k-1&&abs(now)>=10) return;
if (n... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define all(n) begin(n), end(n)
const long long INF = numeric_limits<long long>::max();
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int>> vvint;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef unsigned long long ull;
template <clas... | #include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define REP2(i,x,n) for (int i = x; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
static const int INF = 1e9... | 1 |
#include <algorithm>
#include <cmath>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <cassert>
#include <func... | #include <iostream>
using namespace std;
int main(){
double t[10], a, b;
char c;
while(cin >> t[0] >> c){
for(int i = 1;i< 10;i++){cin >> t[i] >> c;t[i] += t[i-1];}
cin >> a >> c >> b;
double tmp = t[9]/(a+b)*a;
int ans = 1;
while(tmp > t[ans-1])ans++;
cout << ans << endl;
}
return 0;
} | 1 |
// C++ 14
#include <bits/stdc++.h>
using namespace std;
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) { os << "["; for (int i = 0; i < v.size(); ++i) { os << v[i]; if (i != v.size() - 1) os << ", "; } os << "]"; return os; }
template <typename T> void print(T v, string s = "\n") ... | #include"bits/stdc++.h"
using namespace std;
const int N=5e3+100;
typedef long long LL;
struct node{
LL h,p;
}a[N];
LL dp[N];
bool cmp(node a,node b){
if(a.h+a.p==b.h+b.p)return a.h<b.h;
return a.h+a.p<b.h+b.p;
}
int main()
{
int n;
scanf("%d",&n);
for(int i=0;i<=5050;i++)dp[i]=0x3f3f3f3f3f3f3f3f;
for(int i=1;i... | 0 |
#include <iostream>
using namespace std;
int fld[100][100];//[横][縦]
int Dx[4]={0,-1,0,1};
int Dy[4]={1,0,-1,0};
bool ans[1000];
int counter=0;
bool flag=true;
void dfs(int x,int y,int w,int h,int c){//スタート地点と色を与える
fld[x][y]=-1;
for(int i=0;i<4;i++){
int nx=x+Dx[i],ny=y+Dy[i];//範囲内にある必要あり
if(nx>=0 && nx<w && n... | #include<iostream>
#include<vector>
#include<queue>
#include<map>
using namespace std;
int n,m;
map<int,vector<pair<int,int> > >G[1<<17];
map<int,int>d[1<<17];
main()
{
cin>>n>>m;
for(int i=0;i<m;i++)
{
int a,b,c;cin>>a>>b>>c;
G[a][c].push_back(make_pair(b,c));
G[b][c].push_back(make_pair(a,c));
G[a][c].push... | 0 |
#include<iostream>
using namespace std;
int main() {
int n;
cin >> n;
int p[100] = {};
for (int i = 0;i < n*(n - 1) / 2;i++) {
int a, b, c, d;
cin >> a >> b >> c >> d;
if (c > d)p[a - 1] += 3;
else if (c < d)p[b - 1] += 3;
else {
p[a - 1]++;
p[b - 1]++;
}
}
int ans[100];
for (int i = 0;i < n;... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <sstream>
#include <functional>
#include <numeric>
#include <cmath>
#include <cstring>
#include <queue>
using namespace std;
int n;
const int INF = 1 << 29;
typedef pair<int,int> P;
vector<P> teams;
bool sortSecond(c... | 1 |
// ref. https://img.atcoder.jp/dwacon5th-prelims/editorial.pdf
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <unordered_map>
#include <vector>
#include <string.h>
#include <set>
using nam... | #include<stdio.h>
int main(){
int stu[501];
int ls[2][10001];
int c,n,m,i,j;
for(;;){
c=0;
for(i=0;i<501;i++)stu[i]=0;
scanf("%d",&n);
scanf("%d",&m);
if(n==0)break;
for(i=0;i<m;i++){
scanf("%d%d", &ls[0][i], &ls[1][i]);
if(ls[0][i]==1)stu[ls[1][i]]=2;
if(ls[1][i]==1)stu[ls[0][i]]=2;
}
... | 0 |
#include <bits/stdc++.h>
using namespace std;
bool gt(int h1,int w1,int h2,int w2) {
return h1*h1+w1*w1>h2*h2+w2*w2||(h1*h1+w1*w1==h2*h2+w2*w2&&h1>h2);
}
int main() {
int h,w;
while(scanf("%d %d",&h,&w),h) {
int ans_h=514,ans_w=514;
for(int H=1;H<=150;H++) {
for(int W=H+1;W<=150;... | #include<iostream>
#include<string>
using namespace std;
bool primenumver(int a){
for (int b = 2;; b += 2) {
if (a%b == 0)return false;
if ((b + 1)*(b+ 1) >a)return true;
if (b == 2)b--;
}
}
int main()
{
while (1) {
int a;
cin >> a;
if (a == 0)break;
if (a % 2 == 0) {
for (int b = a-1;; b -= 2) {
... | 0 |
#include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<numeric>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
using ll = long long;
class Stream{
public:
Stream(){
}
//配列以外の入力を受け取る
vo... | #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 |
#include<bits/stdc++.h>
using namespace std;
#define MAXN 2005
#define open(s) freopen( s".in", "r", stdin ), freopen( s".out", "w", stdout )
#define fp( i, b, e ) for ( int i(b), I(e); i <= I; ++i )
#define fd( i, b, e ) for ( int i(b), I(e); i >= I; --i )
#define go( i, b ) for ( int i(b), v(to[i]); i; v = to[i = nxt... | #include <bits/stdc++.h>
#define MOD 1000000007
int ri() {
int n;
scanf("%d", &n);
return n;
}
int main() {
int n = ri();
int m = ri();
int q = ri();
std::string s[n];
for (int i = 0; i < n; i++) std::cin >> s[i];
std::vector<std::vector<int> > k(n + 1, std::vector<int>(m + 1));
std::vector<std::vector<in... | 1 |
#include <bits/stdc++.h>
#define mset(a, b) memset(a, b, sizeof(a))
#define mcpy(a, b) memcpy(a, b, sizeof(a))
#define sor(a, l, r) sort(a + l, a + r + 1);
#define reve(a, l, r) reverse(a + l, a + r + 1)
using namespace std;
typedef long long LL;
const int N = 205;
const int MAXN = 100005;
template <typename T> inline... | #include<iostream>
#include<vector>
#include<cstring>
#include<algorithm>
using namespace std;
const int N_MAX = 100;
const int INF = 1000000;
struct edge{
int to, cap, rev;
edge(int t, int c, int r): to(t), cap(c), rev(r){}
};
vector<edge> G[N_MAX * 2];
bool used[N_MAX * 2];
void add_edge(int from, int to,... | 0 |
#include <iostream>
#include <regex>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
regex rx(R"(^A[a-z][a-z]*?C[a-z]*?[a-z]$)");
if (regex_match(S, rx)) {
printf("AC\n");
} else {
printf("WA\n");
}
}
| #include <stdio.h>
#define N 200002
char s[N], x, y;
int p[N];
int main()
{
int i, j, tp, l;
s[0] = 0;
scanf("%s", s + 1);
for(i = 1, j = 0; s[i]; j = i++){
p[i] = j;
}
p[i] = j, l = i - 1;
for(i = 2; x = s[i]; i++){
if(x == 'T'){
if(s[tp = p[i]] == 'S'){
l -= 2;
p[i + 1] = p[tp];
}
}
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin >> n >> k;
int x[n];
for(int i=0;i<n;i++){
cin >> x[i];
}
sort(x,x+n,greater<int>());
int sum=0;
for(int i=0;i<k;i++){
sum+=x[i];
}
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PLL = pair<ll, ll>;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repn(i,n) for(int i = 0; i <= (int)(n); i++)
#define srep(i,l,n) for(int i = l; i < (int)(n); i++)
#define srepn(i,l,... | 1 |
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
struct edge{
int to;
int cap;
int rev;
};
struct Dinic{
int V;
vector<int> level, used;
vector<vector<edge>> G;
Dinic(int N){
V = N;
used.resize(V, 0);
level.resize(V, -1);
G.resize(V)... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<pair<int,int>> ab(n),cd(n);
for(int i=0;i<n;++i){
int a,b;
cin >> a >> b;
ab[i]=make_pair(b,a);
}
for(int i=0;i<n;++i){
int c,d;
cin >> c >> d;
cd[i]=make_pair(c,d);
}
sort(ab.begin(),ab.end(),grea... | 1 |
#include <bits/stdc++.h>
#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(int i=0;i<(n);i++)
#define RREP(i,n) for(int i=n-1;i>=0;i--)
#define PB push_back
#define INF (1<<29)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
... | #include"bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
int h,... | 0 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <functional>
#include <numeric>
using namespace std;
using lint = int64_t;
using P = pair<int, int>;
using D ... | #include<bits/stdc++.h>
using namespace std;
int main(){
int K,X;
cin>>K>>X;
for(int i=0;i<2*K-1;i++){
cout<<X-K+1+i<<" ";
}
cout<<endl;
}
| 0 |
//
// Created by TakahiroYamaji on 2020/08/13.
//
#include<iostream>
#include<queue>
typedef long long ll;
int D;
ll G;
int p[11];
ll c[11];
ll solve(int i){
ll ans = 0;
ll sum = 0;
std::priority_queue<ll>P;
for (int j=0;j<D;j++){
//std::cout << j << std::endl;
if (i & (1 << j)){
... | #include <bits/stdc++.h>
using namespace std;
int soredake(int point, int kazu, int bonasu, int goal) {
int tokukazu = goal / point;
if (goal % point > 0) {
tokukazu++;
}
if (tokukazu > kazu) {
tokukazu = kazu;
}
return tokukazu;
}
int search(vector<vector<int>> questions, int goal) {
int minim... | 1 |
#include <bits/stdc++.h>
using namespace std;
int N;
vector<int> A(210);
int main() {
cin>>N;
for(int i=0;i<N;i++) cin>>A.at(i);
int count=0;
while(true){
bool exist_odd=false;
for(int i=0;i<N;i++){
if(A.at(i)%2!=0) exist_odd=true;
}
if(exist_odd) break;
for(int i=0;i<N;... | #include<iostream>
using namespace std;
const int BUF = 2000005;
const int MOD = 1000000007;
int add(int a, int b) {
return (a + b) % MOD;
}
int sub(int a, int b) {
return (a - b + MOD) % MOD;
}
int mul(int a, int b) {
return 1LL * a * b % MOD;
}
int nNum;
int a[BUF], b[BUF];
void read() {
cin >>... | 0 |
//om namah shivaay
//faith over fear
//no one wants to die,yet death is the destination we all share
#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define ll long long
#define all(x) (x).begin(), (x).end()
#define ral... | #include <iostream>
#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>
#inc... | 0 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <limits>
#include <iomanip>
#include <vector>
#include <cstring>
#include <queue>
#include <map>
#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;
using ll = long long;
using ld = long double;
using ull =... | #include <bits/stdc++.h>
using namespace std;
int main()
{
string S;
cin >> S;
string ans = "AC";
if( S[0] != 'A' ) ans = "WA";
else {
string s = S.substr( 2, S.size() - 2 - 1 );
int n = s.find( 'C' );
if( n == string::npos ) ans = "WA";
else if( s.find( 'C', n + 1 ) != string::npos ) ans = "WA";
else ... | 1 |
#include<iostream>
using namespace std;
typedef long long ll;
int main(){
ll n;
while(cin>>n){
ll ans,x;
ans=n/11<<1;
x=n%11;
if(x>6)
ans+=2;
else if(x)
ans++;
cout<<ans<<endl;
}
return 0;
}
| #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define printVec(v) printf("{"); for (const auto& i : v) { std::cout << i << ", "; } printf("}\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 ... | 1 |
#ifdef __GNUC__
#pragma GCC target("avx2")
#pragma GCC optimize ("O20")
#pragma GCC optimize ("tree-vectorize")
#pragma GCC optimize("unroll-loops")
#define iss std::cin
#endif
#include "bits/stdc++.h"
#define rep(i, times) for(ll i = 0; i < (times); ++i)
#define p(x) (cout << x << "\n")
using ll = long long; using ld ... | #include<bits/stdc++.h>
#define N 100005
#define int long long
using namespace std;
inline void rd(int &X){
X=0;int w=0;char ch=0;
while(!isdigit(ch))w|=ch=='-',ch=getchar();
while( isdigit(ch))X=(X<<3)+(X<<1)+(ch^48),ch=getchar();
X=w?-X:X;
}
int n,m,k;
int x[N],d[N],ans[N],t[N];
double a[N];
signed ... | 0 |
#include <iostream>
using namespace std;
int main(void){
int cd=0;
char c;
for (int i=0; i<3; i++){
cin >> c;
cd = (cd<<1) | (c=='R'?1:0);
}
cout << (cd["01121123"]) << endl;
return 0;
} | #include <iostream>
#include <string>
#include <cmath>
using namespace std;
int main(){
string S;
cin >> S;
int i, l, count, max;
l = S.length();
count = 0;
max = 0;
for (i = 0; i < l; i++){
if (S.at(i) == 'S'){
count = 0;
} else {
... | 1 |
#include <iostream>
#include <string>
#include <sstream>
#include <algorithm>
#include <vector>
#include <utility>
#include <functional>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <deque>
using namespace std;
#def... | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 200010, INF = 1ll << 45;
int n,q,a,b,que[N];
struct node {
pair<int,int> lmn,rmn;
int l,r,tag;
} t[N << 2];
void puttag(int x,int val) {
t[x].tag += val;
t[x].lmn.first += val;
t[x].rmn.first += val;
}
void push_down(int x) {
... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
//long long
using ll = long long;
//出力系
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
// begin(... | #include <iostream>
using namespace std;
int main()
{
string test;
getline(cin,test);
if (test[0] == 'A' && test[1] == 'C')
{
cout << "Yes" << endl;
}
else if(test[1] == 'A' && test[2] == 'C')
{
cout << "Yes" << endl;
}
else if(test[2] == 'A' && test[3] == 'C')
{
cout << "Yes" << endl;... | 1 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <string>
#include <ctype.h>
#include <algorithm>
using namespace std;
#define loop(i,a,b) for(int i=(a); i<(int)(b); i++)
#define rep(i,b) loop(i,0,b)
#define all(c) (c).begin(), (c).end()
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<in... | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
string bstr;
while (getline(cin, bstr)) {
int n = 26;
while (n--) {
if (bstr.find("this", 0) != string::npos) {
break;
} else if (bstr.find("that", 0) != string::npos) {
break;
} e... | 1 |
#include <stdio.h>
int main(){
int n,m,i,j,x[20],y[20],z[30],p[31],q[31],a[20],b[20],c[20],s;
char d[i];
while(1) {
scanf("%d",&n);
if (n==0) break;
for (i=0;i<n;i++) {
scanf("%d %d",&x[i],&y[i]);
}
scanf("%d",&m);
for (i=0;i<m;i++) {
... | #include<iostream>
#include<string>
using namespace std;
int main(){
int map[21][21];
int dx,dy;
int get;
int n,m;
int x,y;
int len;
int i,j;
string A;
while(1){
get = 0;
dx = 10;
dy = 10;
for(i = 0 ; i < 21 ; i++){
for(j = 0 ; j < 21 ; j++){
map[i][j]=0;
}
}
ci... | 1 |
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int main(){
int n, m, a[1000], b[1000], vote[1000]={0};
scanf(" %d %d", &n, &m);
for(int i=0; i<n; ++i) scanf(" %d", &a[i]);
for(int i=0; i<m; ++i) scanf(" %d", &b[i]);
sort(b,b+m, greater<int>());
int now=0;
for(int i=0; i<m; +... | #include <bits/stdc++.h>
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 (b<a) { a=b; return 1; } return 0; }
using ll = long long;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const i... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long n,sum,fs,bs,fbs;
cin >> n;
sum = n,fs = 0, bs = 0, fbs = 0;
for (int i = 0; i < n; i++) {
sum += i;
}
for (int i = 3; i <= n; i += 3) {
fs += i;
}
for (int i = 5; i <= n; i += 5) {
bs += i;
}
for (int i = 15; i <= n; i += 1... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
long long MOD = 10000000000 + 7;
int main(){
cout << setprecision(10);
ll N; cin >> N;
ll ans = 0;
for(ll i = 1; i <= N; i++){
if( i%3 == 0 || i%5 == 0){
} else {
ans += i;
}
}
cout << ans <<... | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.