code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<set>
#include<queue>
#include<stack>
#include<bitset>
using namespace std;
int p = 998244353;
#define int long long
#define vel vector<long long>
#define vvel vector<vel>
#define rep(i,n) for(long long i=0;i<n;i++)
#define sor(v) sort(v.b... | #include<iostream>
#include<cstdio>
using namespace std;
int n,sz;
int a[10101],d[10101];
long long an[1010][1010];
void init(int N)
{
for(int i=2;i<=N;i++)
{
if(!d[i])a[++sz]=i;
for(int j=1;j<=sz&&a[j]*i<=N;j++)
{
d[i*a[j]]=1;
if(i%a[j]==0) break;
}
}
}
long long gcd(long long x,long long y){ return y... | 1 |
#include<bits/stdc++.h>
#define del(a,i) memset(a,i,sizeof(a))
#define ll long long
#define inl inline
#define il inl void
#define it inl int
#define ill inl ll
#define re register
#define ri re int
#define rl re ll
#define mid ((l+r)>>1)
#define lowbit(x) (x&(-x))
#define INF 0x3f3f3f3f
using namespace std;
template<c... | #include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
#define MOD 998244353
using namespace std;
typedef long long ll;
ll ppow(ll a,ll b){
ll res=1;
while(b){
if(b&1)res=(res*a)%MOD;
a=(a*a)%MOD;
b>>=1;
}
return res;
}
ll C[5000][5000];
int main(){
for(int i=0;i<5000;i++){
for(int j=0;j<=i;j++)... | 1 |
#include<stdio.h>
const int MAX_V=10000;
int prime[MAX_V+1];
int main(){
int i,k,n,p,q,v;
for(i=2;i<=MAX_V;i++){
prime[i]=1;
}
for(i=2;i*i<=MAX_V;i++){
if(prime[i]){
for(k=2*i;k<=MAX_V;k+=i){
prime[k]=0;
}
}
}
while(1){
scanf("%d",&n);
if(n==0)break;
for(v=2;v<=n-... | #include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
using namespace std;
int prime[2020],np;
bool vis[10101];
void findprime()
{
memset(vis,0,sizeof(vis));
np=0;
for(int i=2;i<=10000;i++)
{
if(!vis[i])
prime[++np]=i;
for(int j=1;j<=np&&i*prime[j]<=10000;j++)
{
vis... | 0 |
#include<bits/stdc++.h>
const int maxn = 1001;
int vis[maxn][maxn];
int n,d1,d2;
void set(int d){
int t = 0;
for(;d % 4 == 0;d /= 4) ++ t;
if(d % 4 == 1){
for(int i = 0;i < n * 2;++i) for(int j = 0;j < n * 2;++j)
vis[i][j] |= (i ^ j) >> t & 1;
} else {
for(int i = 0;i < n * 2;++i) for(int j = 0;j < n * 2;++j... | #include <bits/stdc++.h>
using namespace std;
#define iota(i,n,b,s) for(int i=int(b);i!=int((b)+(s)*(n));i+=(s))
#define range(i,n,m) iota(i,(((n)>(m))?((n)-(m)):((m)-(n))),(n),((n)>(m)?-1:1))
#define rep(i,n) iota(i,(n),0,1)
#define loop for(;;)
#define INF (1e9)
#define EPS (1e-9)
#define cons(a,b) (make_pair(a,b))... | 0 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPLL(i, n) for (ll i = 0; i < (ll)(n); i++)
using namespace std;
template<class T>inline bool chmax(T &a, const T &b){if(a < b){a = b; return 1;}return 0;}
template<class T>inline bool chmin(T &a, const T &b){if(a > b){a = b; return ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const int inf = 1e9;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, b, a) for (int i = a - 1; i >= b; i--)
#define int long long
using Graph = vector<vector<int>>;
using pint = pair<int, int>;
int dx[4] = {1, 0, -1... | 1 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#in... | #include<bits/stdc++.h>
//using namespace std;
#define rep(i,j,n) for(ll i=(ll)(j);i<(ll)(n);i++)
#define REP(i,j,n) for(ll i=(ll)(j);i<=(ll)(n);i++)
#define per(i,j,n) for(ll i=(ll)(j);(ll)(n)<=i;i--)
#define ll long long
#define ALL(a) (a).begin(),(a).end()
#define disup(A,key) distance(A.begin(),upper_bound(ALL(A),(... | 1 |
#include<cstdio>
const int N=1e5+5;
int n,i,a[N],ans;
int read(){
char c=getchar();int k=0;for (;c<48||c>57;c=getchar());
for (;c>47&&c<58;c=getchar()) k=(k<<3)+(k<<1)+c-48;return k;
}
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int main(){
for (n=read(),i=1;i<=n;i++) a[i]=read();
if (n==1){puts("Second");return 0... | #include <iostream>
#include <algorithm>
#include <numeric>
#include <vector>
using namespace std;
template <class T>
T gcd(T a, T b) {
while (b > 0) {
a %= b;
swap(a, b);
}
return a;
}
bool solve(int N, vector<int>& A) {
if (N == 1) return false;
// 総和の偶奇
int parity = accumu... | 1 |
#include <iostream>
#include <string>
using namespace std;
int main(){
string str;
while(getline(cin,str)){
int flg = 0;
while(true){
for(int i = 0 ; i < str.length() ; i++){
string key1 = str.substr(i,3),key2 = str.substr(i,4);
if(key1 == "the" || key2 == "that" || key2 == "this") flg = 1;
... | #include<stdio.h>
int main()
{
int h,w,k,omen;
scanf("%d %d %d",&h,&w,&k);
if(h > w) omen = h;
else omen = w;
int count = 1;
for(int i = omen;i<k;i += omen)
{
count++;
}
printf("%d\n",count);
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a = 0,b = 0;
cin >> a >> b;
a--;
b--;
cout << (b + (a - 1)) / a << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define REP(i,n) for (int64_t i=0; i<(n); ++i)
#define P pair<int,int>
using ll=int64_t;
using namespace std;
#define ketasuu(n) fixed<<setprecision(n)
#define btoe(p) p.begin(),p.end()
#define etob(p) p.rbegin(),p.rend()
int main(){
int n;... | 0 |
#include<bits/stdc++.h>
using namespace std;
struct Point{
int x,y,idx;
bool operator<(const Point& rhs)const{
return x==rhs.x?y<rhs.y:x<rhs.x;
}
}P[100];
bool bad(const Point& p1,const Point& p2,const Point& p3){
return 1LL*(p3.x-p1.x)*(p2.y-p1.y)-1LL*(p2.x-p1.x)*(p3.y-p1.y)<=0;
}
vector<Point> convex(int n){
... | #include <bits/stdc++.h>
using namespace std::literals::string_literals;
using i64 = long long;
using std::cout;
using std::endl;
using std::cin;
template<typename T>
std::vector<T> make_v(size_t a){return std::vector<T>(a);}
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
return std::vector<dec... | 0 |
#include <bits/stdc++.h>
#define INF 1e9
using namespace std;
#define REPR(i,n) for(int i=(n); i >= 0; --i)
#define FOR(i, m, n) for(int i = (m); i < (n); ++i)
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define ALL(a) (a).begin(),(a).end()
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <clocale>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <l... | 1 |
#include <iostream>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <vector>
using namespace std;
//const char a[26]={'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
// input - given string
// You need to update in the given string itself... | #include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | 1 |
#include <bits/stdc++.h>
#define INF 1000000000
#define MAX_N 100
using namespace std;
typedef pair<int, int> P;
struct edge {
int to, cost;
edge(int to_, int cost_) : to(to_), cost(cost_) {}
};
int n;
vector<edge> G[MAX_N];
int Prim() {
int res = 0;
vector<bool> used(n, false);
priority_queue<P, vector<P>, grea... | #include <algorithm>
#include <iostream>
using namespace std;
int P[10010];
void init(int N){
for (int i=0; i<N; i++) P[i] = i;
}
int root (int a){
if (P[a] == a) return a;
else {
P[a] = root(P[a]);
return P[a];
}
}
bool is_same_set(int a, int b){
return root(a) == root(b);
}
void unite(int a, int b)... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<int(n);++i)
typedef complex<double> Point;
typedef vector<Point> VP;
#define X real()
#define Y imag()
const double EPS = 1e-9;
const double PI = acos(-1.0);
#define LE(n,m) ((n) < (m) + EPS)
#define GE(n,m) ((n) + EPS > (m))
#define EQ(n,m) ... | #include<iostream>
#include<math.h>
#include<algorithm>
#include<tuple>
using namespace std;
#define fr(i,n) for(int i=0;i<n;i++)
typedef double db;
typedef tuple<bool,db> bod;
db Pi = 3.14159265358979;
db st(db t){
t+=4*Pi;
while(t>=0) t-=2*Pi;
t+=2*Pi;
return t;
}
bod J(db a,db b){
if(a<=Pi){
return m... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ld long double
#define mod 1000000007LL
#define eps 1e-13
// #define PI 3.141592653589793238L
#define INF 1000000011
#define INFLL 1000000000000000011LL
#define vi vector<int>
#define vll vector<long long>
#define ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=55,mod=1e9+7,inf=2000000000;
int n,a[N];
char s[N];
unordered_map<ll,int>vis[20][20];
int main()
{
scanf("%d",&n);
scanf("%s",s+1);
int up=1<<n;
for(int i=0;i<up;i++)
{
ll sum1=0,sum2=0,a=__builtin_popcount(i),b=n... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define FOR(i,s,n) for(int i = s; i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
#define ATYN(n) cout << ( (n) ? "Yes":"No") << '\n';
#define CFYN(... | #include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <math.h> // sqrt
#include <map> // map
#inc... | 0 |
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define piii pair<int,pii>
#define pll pair<ll,ll>
#define plii pair<ll,pii>
#define vi vector<int>
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define SORT(x) sort(x.begin(), x.end())... | #pragma GCC optimize ("Ofast")
#include"bits/stdc++.h"
using namespace std;
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
struct _ { ios_base::Init i; _() { cin.sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(10); } } ___;
#define trace(.... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define pii pair<int, int>
int main(){
int n; cin>>n;
vector<int> v;
for(int i = 1; i <= 2*n; i++){
int x; cin>>x;
v.push_back(x);
}
sort(v.begin(), v.end());
int res = 0;
for(int i = 0; i < (2*n)-1; i += 2)... | //#include<bits/stdc++.h>
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <cstring>
#include <algorithm>
using namespace std;
/*#define fast ios_base::sync_with_stdio(0); cin.tie(0)*/
#define ff first
#define ss second
#define pb push_back
#define mp make_pa... | 0 |
#include <bits/stdc++.h>
using namespace::std;
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef array<int, 3> tri;
typedef long double ld;
template <class T> istream& operator>>(istream& I, vector<T>& v) {for (T &e: v) I >> e; return I;}
template <class T> ostream& operator<<(ostream &O, const vec... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <cmath>
#include <stdio.h>
#include <list>
#include <numeric>
#include <stack>
#include <queue>
#include <tuple>
#include <bitset>
#include <map>
#include <math.h>
//ceil(a/b) (a + (b - 1))/ b
using namespace std;
#de... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
vector<int>X(26,0);
string S;cin>>S;
for(long long i=0;i<S.size();i++){
X[(int)S[i]-97]++;
}
for(long long i=0;i<26;i++){
if(X[i]==0){
int ans=i+97;
cout<<(char)ans<<endl;
return 0;
... | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
for (char c='a'; c<='z'; c++) {
if (s.find(c) == string::npos) {
cout << c << endl;
return 0;
}
}
cout << "None" << endl;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,d;
cin>>a>>b>>c>>d;
int sum1=min(a,b);
int sum2=min(c,d);
int sum=sum1+sum2;
cout<<sum<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int N=2e5+5,MOD=1e9+7;
long long fac[N],infac[N];
long long poww(long long x,long long y)
{
if(y==0) return 1;
if(y&1) return (x*poww(x,y-1))%MOD;
return poww((x*x)%MOD,y/2);
}
long long nck(int n,int k)
{
return (((fac[n]*infac[k])%MOD)*infac[n-k])%MOD;
}
l... | 0 |
#include <bits/stdc++.h>
#define rep(i, f, n) for (ll i = (f); i < (ll)(n); i++)
#define repe(i, f, n) for (ll i = (f); i <= (ll)(n); i++)
using namespace std;
using ll = long long;
using pint = pair<int, int>;
int main() {
int N;
cin >> N;
repe(i, N, 999) {
string s = to_string(i);
bool ok = true;
r... | #include <iostream>
using namespace std;
int main(void){
int n,i;
cin >> n;
for(i=n;i<n+111;i++){
if(i%111==0) break;
}
cout << i;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
vector<char> name = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k',
'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z'};
ll block = 0;
vector... | #include <iostream>
using namespace std;
int main() {
int T, t, b{-(1<<30)}, ans{};
cin >> T >> T;
while (cin >> t) {
ans += t < b + T ? t - b : T;
b = t;
}
cout << ans << endl;
}
| 0 |
#include<iostream>
#include<string>
using namespace std;
int data[7];
void N(){int x=data[5];data[5]=data[1];data[1]=data[2];data[2]=data[6];data[6]=x;}
void S(){int x=data[5];data[5]=data[6];data[6]=data[2];data[2]=data[1];data[1]=x;}
void E(){int x=data[3];data[3]=data[1];data[1]=data[4];data[4]=data[6];data[6]=x;}
v... | // copied by Nurstan Duisengaliev
// skatal
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define all(x) x.begin(), x.end()
#define in insert
#define mp make_pair
#define F first
#define S second
#define ppf pop_front
#define pb push_b... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef set<int> si;
typedef pair<int,int> pii;
#define rep(i,a,b) for(int i=(a); i<(b); ++i)
#define per(i,a,b) for(int i=(b)-1; i>=(a); --i)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).si... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> P;
typedef pair<int,int> Pi;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define fi first
#define se second
#define endl "\n"
template<typename T> inline bool ... | 1 |
//g++ -std=gnu++14 a.cpp
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
#include <random>
#inclu... | #include<iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <set>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
/*int t;
cin >> t;
while (t--){
int n;
cin >> n;
vector<int>v(n);
for (int i = 0; i < n; i++){
cin >> v[i];... | 1 |
#include <cstdio>
using namespace std;
#define MAXN 100
#define INFTY (1 << 21)
#define WHITE 0
#define GRAY 1
#define BLACK 2
int n, M[MAXN][MAXN];
int prim()
{
int d[MAXN], p[MAXN], color[MAXN];
int u, minv;
for(int i = 0; i < n; i++)
{
d[i] = INFTY;
p[i] = -1;
color[i] = WHITE;
//printf("===\n");
}
d... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>; using vvi = vector<vi>;
using vb = vector<bool>; using vvb = vector<vb>;
using vl = vector<ll>; using vvl = vector<vl>;
using vd = vector<double>; using vvd = vector<vd>;
#define REP(i,n) for(au... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define endl "\n"
#define se second
#define ls( s) (s&(-s))
#define ll long long
#define inf 0x3f3f3f3f
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
const int N = 2e5+5;
#define rep(i, begin, end) for (__typeof(end) i = (begin) - ((... | #include<iostream>
#include<map>
#include<vector>
#include<algorithm>
#include<cstdint>
#include<cstdlib>
template<typename T>
void fin(T const& t){ std::cout << t << std::endl; exit(0); }
int msb(int x) { return 31 - __builtin_clz(x); }
int main() {
int N; std::cin >> N;
std::map<int,int> m;
for(int i = 0; i <... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
int L = a+b, R = c+d;
if (L>R) cout << "Left" <<endl;
if (L==R) cout << "Balanced" << endl;
if (L<R) cout << " Right" << endl;
} | #include <cstdio>
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
int cs[5];
while( scanf( "%d,%d,%d,%d,%d", &cs[0], &cs[1], &cs[2], &cs[3], &cs[4] ) != -1 ) {
sort( cs, cs + 5 );
vector<int> uc( 5 );
unique_copy( cs, cs+5, uc.begin() );
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long int n, a, b;
cin >> n >> a >> b;
long long int x[n], diff[n]={};
long long int ans=0;
for(int i=0; i<n; i++){
cin >> x[i];
if(i==0) continue;
if((x[i]-x[i-1])*a<b) ans += (x[i]-x[i-1])*a;
else ans += b;
}
cout << ans ... | #include<bits/stdc++.h>
using namespace std;
int main () {
int N;
cin >> N;
long long A, B;
cin >> A >> B;
long long ans = 0;
long long x;
cin >> x;
for (int i = 0; i < N - 1; i ++) {
long long k = 0;
cin >> k;
ans += min((k - x) * A, B);
x = k;
}
cout << ans << endl;
}
| 1 |
#include<bits/stdc++.h>
using namespace std;
#define ll double
#define mod 1e9+7
#define fast_io ios_base::sync_with_stdio(false); cin.tie(NULL)
ll dp[301][301][301];
ll solve(int one, int two, int three, int& n)
{
if(one < 0 || two < 0 || three < 0) return 0;
if(one == 0 && two == 0 && three == 0) return 0;
if(... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define endl '\n'
#define pb push_back
#define fi first
#define se second
#define all(c) (c).begin(),(c).end()
typedef long long ll;
typedef long ... | 1 |
#include <iostream>
#include <vector>
#include <queue>
#include <string>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int q;
cin >> q;
vector<int> lk(q);
vector<ll> memo(n, 0);
for (int &k: lk) cin >> k;
for (int k : lk) {
ll ans = 0;
vector<... | #include<cmath>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define gt getchar()
#define ll long long
#define File(s) freopen(s".in","r",stdin),freopen(s".out","w",stdout)
typedef std::pair<int,int> P;
#define mk std::make_pair
#define fr first
#define sc second
inline int in()
{
int k=0;char ch=gt;bool p=1... | 0 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>
#include <fstream>
#include <bitset>
#include ... | #include <stdio.h>
int check(int a,int b,int c)
{
//printf("[%d][%d][%d]\n",a,b,c);
if(a != 14)return 0;
else if(b == 23)return 1;
else if(b == 1 && c == 10)return 1;
else if(b == 19 && c == 19)return 1;
else return 0;
}
int main()
{
int longth,mem = 0;
while(1)
{
char str[9... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int main(){
int n;
while(cin>>n,n){
unsigned long long a[5000]={0},c=0,p,o,u;
rep(i,n){
cin>>p>>o>>u;
a[p]+=o*u;
if(a[p]>=1000000){cout<<p<<endl;c++;}
}
if(!c)cout<<"NA"<<endl;
}
} | #include<iostream>
#include<string>
using namespace std;
int main()
{
int n;
int ans[4000];
for(;;)
{
cin >> n;
if(n==0)
break;
int i,j;
for(i=0,j=0;i<n;i++)
{
int num[4000];
int flag=1;
double a[4000],b[4000];
double ans_max[4000];
cin >> num[i] >> a[i] >> b[i] ;
ans_max[i]=a[... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
const int INF=1e9+7;
const ll LINF=9223372036854775807;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld EPS = 1e-10; //微調整用（EPSより小さいと0と判定など）
... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
#define irep(i, n) ... | 0 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <deque>
#include <queue>
#include <array>
#include <set>
#include <map>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <cassert>
#include <utility>
#include <functional>
#include <bitset>
using namespace std;
using l... | #include<bits/stdc++.h>
using namespace std;
#define FOR(i,s,e) for(int i=(s);(i)<(int)(e);++(i))
#define REP(i,e) FOR(i,0,e)
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();++it)
#define all(o) (o).begin(), (o).end()
#define psb(x) push_back(x)
#define ppb(x) pop_back(x)
#define mp make_pair... | 0 |
#include<bits/stdc++.h>
using namespace std;
const int MOD = 998244353;
int sum(int a, int b) {
return a + b >= MOD ? a + b - MOD : a + b;
}
int sub(int a, int b) {
return a - b < 0 ? a - b + MOD : a - b;
}
int mul(int a, int b) {
return (1LL*a*b)%MOD;
}
int pw(int a, int b) {
if (!b) return 1;
int r = p... | #include<iostream>
#include<vector>
#include<string>
#include<set>
#define rep(i, start, end) for (int i = (int)start; i < (int)end; ++i)
#define rrep(i, start, end) for (int i = (int)start - 1; i >= (int)end; --i)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
template<typename T> inl... | 0 |
#include <set>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
typedef long long ll ;
#define rep(i, a, b) for (int i = a; i <= b; ++ i)
const int N = 1e5 + 5 ;
using namespace std ;
int cnt, n, a[4][N], d[5], b[N], bit[N], c[N], ind[N], outd[N] ; bool vis[N] ;
struct p... | #include<bits/stdc++.h>
typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
typedef double lf;
typedef long double llf;
typedef std::pair<int,int> pii;
#define xx first
#define yy second
template<typename T> inline T max(T a,T b){return a>b?a:b;}
template<typename T> inline T min(T a,T b... | 1 |
#include <bits/stdc++.h>
using namespace std;
//#define cerr if (false) cerr
#define db(x) cerr << #x << "=" << x << endl
#define db2(x, y) cerr << #x << "=" << x << "," << #y << "=" << y << endl
#define db3(x, y, z) cerr << #x << "=" << x << "," << #y << "=" << y << "," << #z << "=" << z << endl
#define dbv(v) cerr <<... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(a) (long long)((a).size())
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
ll mod = 1e9+7;
ll n,i,j,m;
cin>>n>>m;
vector<ll> x(n), y(m);
... | 0 |
#include<iostream>
#include<algorithm>
#define MAX 100
#define INFTY (1 << 21)
using namespace std;
int p[MAX + 1], mat[MAX + 1][MAX + 1];
void matrixChainMultiplication(int n) {
for (int i = 1; i <= n; i++) {
mat[i][i] = 0;
}
for (int l = 2; l <= n; l++) {
for (int i = 1; i <= n - l + 1; i++) {
int j = i +... | #include <stdio.h>
const int N=110;
const int INF=1<<30;
int min(int a,int b){
return a>b?b:a;
}
int main(){
int n,dp[N][N],a[N];
scanf("%d%d%d",&n,&a[0],&a[1]);
for(int i=1;i<n;i++)scanf("%d%d",&a[i],&a[i+1]);
for(int k=1;k<n;k++){
for(int i=0;i<n-k;i++){
dp[i][i+k]=INF;
... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int main(){
int N;string A,B,C;cin>>N>>A>>B>>C;
int ans=0;int a=0;
rep(i,N){
if(A.at(i)==B.at(i)){
a++;
}
if(B.at(i)==C.at(i)){
a++;
}
if(C.at(i)==A.at(i)){
a++;
}
if(a==0){
ans++;
ans++;
}else if(a==... | #include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define space putchar(' ')
#define enter putchar('\n')
#define MAXN 200005
#define eps 1e-10
//#define ivorysi
using namespace std;
typedef long long int64;
typedef double db;
template<class T... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... | /*~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=
*$* WRITER:kakitamasziru/OxOmisosiru *$*
~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=*/
#ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG //FOR THE DEBUG! COMMENT OUT THIS WHEN SUBMITTING!
#endif
/* I REALLY HOPE MY WISH REACH YOU , ATCODER'S ONLINE JUDGE */
#define WOULD
#define YOU
#define ... | 0 |
#include<iostream>
#include<string>
#include<vector>
#include<cstdio>
#include<sstream>
#include<algorithm>
#include<cmath>
#include<map>
using namespace std;
int main(){
int n, dp[50];
while(cin>>n,n!=0){
fill(dp,dp+50,0);
dp[0]=0,dp[1]=1,dp[2]=1,dp[3]=2;
for(int i=3;i<=n+1;i++)dp[i]=dp[i-1]+dp[i-2]+dp[i-3];
int ans=d... | #include <iostream>
#include <algorithm>
using namespace std;
int main(){
int tmp;
int dp[100];
cin>> tmp;
do{
fill(dp,dp+100,0);
dp[0] = 1;
for (int i = 0; i<tmp;i++)
{
for(int j = 1;j < 4;j++)
dp[i+j] += ... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long Int;
typedef pair<Int,Int> PII;
typedef vector<int> VInt;
#define FOR(i, a, b) for(i = (a); i < (b); ++i)
#define RFOR(i, a, b) for(i = (a) - 1; i >= (b); --i)
#define EACH(it, a) for(auto it = (a).begin(); it != (a).end(); ++it)
#define CLEAR(a, b) mem... | #include <stdio.h>
#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <algorithm>
using ll = long long int;
const int INF = (1<<30);
const ll INFLL = (1ll<<60);
#define l_ength size
ll MOD;
void mul_mod(ll& a, ll b){
a *= b;
a %= MOD;
}
void add_mod(ll& a, ll b){
a = (a<MOD)?a:(a-M... | 1 |
#include<iostream>
#include<math.h>
#include<bits/stdc++.h>
#define ll long long int
#define hell 1000000007LL
using namespace std;
ll power(ll x, ll y){
if(y==0)
return 1;
else
{
ll p=power(x,y/2);
if(y%2==0)
return (p*p)%hell;
else
return (x*((p*p)%hell))%hel... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if(A==B){
cout << A+B << endl;
}
else if(A>B){
cout << A+A-1 << endl;
}
else if(A<B){
cout << B+B-1 << endl;
}
} | 1 |
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <algorithm>
#include <utility>
#include <functional>
#include <sstream>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <climits>
using na... | #include<cstdio>
#include<queue>
#include<algorithm>
#include<functional>
using namespace std;
int flag[301] = {0};
int main(void){
while(1){
for(int i = 1;i <= 300;i++){
flag[i] = 2;
}
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
if(a == 0 && b == 0 && c == 0) break;
... | 0 |
#include <iostream>
using namespace std;
int main () {
int x, y;
cin >> x >> y;
cout << x*y;
} | #include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#include<set>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<pii,int> piii;
typedef pair<ll,ll> pll;
#define reps(i,f,n) for(int i = int(f); i <= ... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i,s,n) for(int i=s;i<n;i++)
#define MOD 1000000007
#define NUM 2520
#define INF (1LL<<50)
#define DEBUG 0
#define mp(a,b) make_pair(a,b)
#define SORT(V) sort(V.begin(),V.end())
#define PI (3.141592653589794)
#define P pair<lli,lli>
... | #include <bits/stdc++.h>
#include <climits>
using namespace std;
int main(){
int N;
string A,B,C;
cin >> N;
cin >> A >> B >> C;
int ans = 0;
for(int i = 0; i < N;i++){
if(A[i] == B[i] && B[i] != C[i] && C[i] != A[i])ans++;
else if(A[i] != B[i] && B[i] == C[i] && C[... | 1 |
#include <iostream>
#include <string>
int main(){
int n;
std::string str;
std::cin >> n;
std::getline(std::cin, str);
for (int i = 0; i < n; ++i){
std::getline(std::cin, str);
while(str.find("Hoshino") != std::string::npos){
str.replace(str.find("Hoshino"), 7, "Hoshina");
}
std::cout << str << s... | #include <bits/stdc++.h>
#include <cstdlib>
using namespace std;
int64_t n;
// 4*4
char moji4[4][4] = {
{ 'a' , 'b', 'c', 'c' },
{ 'a' , 'b', 'd', 'd' },
{ 'e' , 'e', 'f', 'g' },
{ 'h' , 'h', 'f', 'g' },
};
// 5*5
char moji5[5][5] = {
{ '.', '.', 'a', 'b', 'c' },
{ '.', '.', 'a', 'b', 'c' },
... | 0 |
#include <bits/stdc++.h>
using namespace std;
int N;
#define MAX_N 100000
int A[MAX_N];
bool F;
int gcd(int a, int b) {
if(b == 0) return a;
return gcd(b, a % b);
}
int main() {
cin >> N;
for(int i = 0; i < N; ++i) cin >> A[i];
F = true;
while(true) {
int c = 0, o = -1;
for(int i = 0; i < N; ++i) ... | #include <cstdio>
typedef long long lint;
int const N=1e5+10;
int n,a[N];
int gcd(int x,int y)
{
if(x==-1 || y==-1) return -x*y;
if(x==0) return y;
else return gcd(y%x,x);
}
int g1[N],g2[N];
int main()
{
scanf("%d",&n);
lint sum=0;
for(int i=1;i<=n;i++) scanf("%d",&a[i]),sum+=a[i];
if(n%2==0... | 1 |
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 2e3 + 3;
int s[MAXN][MAXN], v[MAXN][MAXN], e[MAXN][MAXN], romokh[2][MAXN][MAXN];
int n, m, q;
int a1, a2, b1, b2;
void input();
void cm_romokh();
void solve();
int main() {
ios:: sync_with_stdio(0), cin.tie(0), cout.tie(0);
input();
return 0;
}
void i... | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
#define mp make_pair
typed... | 1 |
#include <iostream>
#include <numeric>
#include <stdio.h>
#include <iomanip>
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cst... | #include <iostream>
#include <string.h>
using namespace std;
int main()
{
int n, i, j;
ios::sync_with_stdio();
string s;
scanf("%d", &n); cin.get();
for (i=0; i<n; i++) {
getline(cin, s);
for (j=0; j+6 < s.size(); j++) {
if (s.substr(j, 7) == "Hoshino") s[j+6] = 'a';
}
cout << s << endl;
}
... | 0 |
#pragma GCC optimize("O2,unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2,ssse3")
#include<bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define pb push_back
using namespace std;
using ll = long long;
using vi = vector<ll>;
using pi = pair<ll, ll>;
const int maxn = 1<<17, mlg = 17, mod = 1e9 + 7;
ll n, l, q, x[m... | //http://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=2676345#1
#include <iostream>
#include<cstdlib>
#include<queue>
#include<set>
#include<vector>
#include<string>
#include<algorithm>
#include<stack>
#include<map>
#include<cstdio>
#include<fstream>
#include<cstring>
using namespace std;
#define rep(i,a) for(int i=0;... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vb> vbb;
typedef pair<int, int> pii;
typedef long long ll;
typedef unsigned long long ull;
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int n, m;
cin >> n >> m;
vector<int> a(m);
vector<char> b(m);
for (int i = 0; i < m; i++)
{
cin >> a[i] >> b[i];
if (n != 1)
{
if (a[i] == 1)
{
if (b[... | 0 |
#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()
void solve() {
int n;
cin >> n;
string a, b;
cin >> a >> b;
for (int i = 0; i < n; i++) {
int f = 0;
for (int j = 0; i + j < n; j++) ... | #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>
#include<unordered_map>
using namespace std;
#define rep(... | 1 |
#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 <bits/stdc++.h>
using namespace std;
const int N = 105;
int a[N], n, cnt, m;
int main() {
scanf("%d %d", &n, &m);
for (int i = 1; i <= m; i++) scanf("%d", &a[i]);
for (int i = 1; i <= m; i++) if (a[i] & 1) cnt ++;
if (cnt > 2) {
puts("Impossible");
return 0;
}
for (int i = 1; i... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m;
while(cin>>n,n){
set<pair<int,int> > sp;
for(int i=0;i<n;i++){
int x,y;
cin>>x>>y;
sp.insert(make_pair(y,x));
}
cin>>m;
int c=0;
pair<int,int> now(10,10);
... | #include <stdio.h>
#include <string.h>
#define N 0
#define E 1
#define S 2
#define W 3
int dir[4][2] = { {0,1}, {1,0}, {0,-1}, {-1,0} };
int map[21][21];
int main(void)
{
while(true) {
int n, m;
int px=10, py=10, s=0;
memset(map, 0, sizeof(map));
scanf("%d\n", &n);
if(n=... | 1 |
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int main(){
int E;
while(cin >> E && E){
int m=1000000;
for(int z=0; z*z*z<=E; ++z){
for(int y=0; y*y+z*z*z<=E; ++y){
int x = E-z*z*z... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> duo;
#define TT template<typename T>
TT T sq(T x){ return x*x; }
TT int ubnd(vector<T>& v,T x){ return upper_bound(v.begin(), v.end(), x) - v.begin(); }
TT int lbnd(vector<T>& v,T x){ return lower_bound(v.begin(), v.end()... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define IO ios::sync_with_stdio(false),cin.tie(0);
#define ll long long
#define inf 0x3f3f3f3f
const int N=105;
//set<string>b;
//set<string>::iterator it;
int main()
{
IO;
double d,t,s,x;
cin>>d>>t>>s;
x=1.0*d/s;
if(x>t) cout<<"No\n";
else cout<<"Yes\n";
return 0... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <iomanip>
#include <limits>
using namespace... | 0 |
#include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm> // require sort next_permutation count __gcd reverse etc.
#include <cstdlib> // require abs exit atof atoi
#include <cstdio> // require scanf printf
#include <f... | #include <iostream>
using namespace std;
void solve()
{
int l[10];
while(cin >> l[0])
{
for(int i = 1; i <= 9; ++i)
{
scanf(",%d", &l[i]);
}
int v[2];
scanf(",%d,%d", &v[0], &v[1]);
int sum = 0;
for(int i = 0; i < 10; ++i)
{
sum += l[i];
}
double time = (double)sum / (v[0] + v[1]);
doub... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int s = 0;
int M = N;
while(M != 0){
s += M % 10;
M = M / 10;
}
if ( N % s == 0)
cout << "Yes" << endl;
if ( N % s != 0)
cout << "No" <<endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int a = (N % 10);
int b = (N-a)/10%10;
int c = (N-10*b-a)/(10*10)%10;
int d = (N-10*10*c-10*b-a)/(10*10*10)%10;
int e = (N-10*10*10*d-10*10*c-10*b-a)/(10*10*10*10)%10;
int f = (N-10*10*10*10*e-10*10*10*d-10*10*c-10*b-a)/(10*... | 1 |
///f. fizzbuzz sequence
#include <stdio.h>
#include <math.h>
int main()
{
long long int n;
scanf("%lld",&n);
long long int d3,d5,d15;
d3=n/3; d5=n/5; d15=n/15;
long long sum = (n*(n+1)-3*d3*(d3+1)-5*d5*(d5+1)+15*d15*(d15+1))/2;
printf("%lld",sum);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long int n,c1=0,c2=0,c3=0,c=1;
cin>>n;
if(n%2==0)
{
for(long long int i=1;i<=n/2;i++)
{
if(i%3==0 || i%5==0 || i%3==0 && i%5==0)
continue;
else
c1+=i;
}
for(long long int j=(n/2)+1;j<=n;j++)
{
if(j%... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
int main() {
int x;
cin >> x;
int happy = 0;
happy += (x / 500) * 1000;
happy += ((x % 500) / 5) * 5;
cout << happy << endl;
} | //https://atcoder.jp/contests/abc160/tasks/abc160_b
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
ll x;
cin>>x;
ll a;
a=x/500;
ll fin1;
fin1=a*1000;
ll b;
b=x%500;
ll c;
c=b/5;
ll fin2;
fin2=c*5;
ll sum=0;
sum=fin1+fin2;
cou... | 1 |
#include<bits/stdc++.h>
#define ll long long int
#define M 1000000007
using namespace std;
ll n,t,x,y,m,q,a,b;
vector<ll>v[100001];
ll vis[100001]={0},ans=0;
pair<ll,ll> dfs(ll x,ll lvl){
vis[x]=1;
ll mx=0;
ll d2=1e9;
if(x==a)d2=0;
for(int i=0;i<v[x].size();i++){
if(vis[v[x][i]]==0){
pair<ll,... | #include <bits/stdc++.h>
int main(){
int N, u, v;
std::cin >> N >> u >> v;
u--; v--;
std::vector< std::vector< int > > AB(N);
for(int i=1; i<N; i++){
int tmpa, tmpb;
std::cin >> tmpa >> tmpb;
tmpa--; tmpb--;
AB[tmpa].push_back(tmpb);
AB[tmpb].push_back(tmpa);... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
double x[n];
double y[n];
for(int i=0;i<n;i++)cin >> x[i] >> y[i];
vector<int>v(n);
for(int i=0;i<n;i++)v[i] = i;
double summ = 0.0;
double cnt = 0;
do{
cnt+=1.0;
for(int i=0;i<n-1;i++){
... | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int n, m;
cin >> n >> m;
int l[m], r[m];
for(int i=0; i<m; i++){
cin >> l[i] >> r[i];
}
int l_prime = *max_element(l, l+m);
int r_prime = *min_element(r, r+m);
if(l_prime > r_prime){
... | 0 |
#include<iostream>
#include<cmath>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<cstring>
#include<queue>
using namespace std;
#define INF 999999999
struct cost{
string name;
double eff;
bool operator<(const cost& a) const{
if(eff != a.eff) return eff > a.eff;
if(name != a.name) return name... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const int INT = 1e9;
const ll LINF = 1e18;
struct UF{
vector<int> d;
UF(int size):d(size,-1){}
bool u(int x,int y){
x = r(x); y = r(y);
if(x != y){
if(d[y] < d... | 1 |
#include<stdio.h>
int main(void){
int a,i;
scanf("%d",&a);
int x[a];
for(i=0;i<a;i++){
scanf("%d",&x[i]);
}
for(i=0;i<a;i++){
printf("%d",x[a-i-1]);
if(i!=a-1){
printf(" ");
}else{
printf("\n");
}
}
}
| #include<bits/stdc++.h>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) range(i,0,b)
#define debug(x) cout << "debug" << x << endl;
using namespace std;
int main(){
int n, num[105];
while(cin >> n){
rep(i,n){
cin >> num[i];
}
for(int i = n - 1; i >= 0; i... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, start, n) for (int i = (int)(start); i < (int)(n); ++i)
static const int INFTY = (1 << 30);
int N, M;
void func()
{
cin>>N;
int a[N+1];
rep(i, 1, N+1) {
cin>>a[i];
}
int b[N+1]={};
// memset(b, -1, sizeof(... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define all(x) (x).begin(),(x).end()
#define cyes cout<<"Yes"<<endl
#define cno cout<<"No"<<endl
#define sp <<" "<<
#define cst(x) cout<<fixed<<setprecision(x)
#define pi 3.14159265359
#define mod 1000000007
template<class T> inline bool chmax(T& a, T b) { ... | 0 |
#include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < (int)(n); i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
using ll = long long;
int main() {
int N; cin >> N;
vector<pair<int, int>> pos, neg;
REP(i, 0, N) {
string s; cin >> s;
int lowest =... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<LL, LL> PII;
// chmax, chmin
template <class T>
inline bool chmax(T &a, T b)
{
if (a < b)
{
a = b;
return 1;
}
return 0;
}
template <class T>
inline bool chmin(T &a, T b)
{
if (a > b)
{
a = b;
return 1;
}
r... | 1 |
#include <bits/stdc++.h>
// #undef DEBUG // Uncomment this line to forcefully disable debug print.
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define dbg(...) ... | #include<bits/stdc++.h>
using namespace std;
const int N = 123456;
int n, m, color[N];
vector<int> adj[N];
bool visit[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
for (int i = 1, x, y; i <= m; ++i) {
cin >> x >> y;
adj[x].push_back(y);
adj[y].push_back(... | 0 |
#include <iostream>
#include <string>
using namespace std;
class Dice{
public:
int l1,l2,l3,l4,l5,l6;
void East(){
int t = l1;
l1 = l4;
l4 = l6;
l6 = l3;
l3 = t;
}
void West(){
int t = l1;
l1 = l3;
l3 = l6;
l6 = l4;
l4 = t;
}
void South(){
int t=l1;
l1 = l5;
l5 = l6;
l6 = l2;
l2 =... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <array>
using namespace std;
#define DEBUG(x) cerr << #x << " = " << x << endl
enum FACE { TOP, FRONT, RIGHT, LEFT, BACK, BOTTOM }; // 1..6
typedef array<int, 6> Dice;
FACE tbl[6][4] = {
{ TOP, BACK, BOTTOM, FRONT },
{ TOP, RIG... | 1 |
#include<bits/stdc++.h>
#define MAXN 1000005
#define P int(998244353)
using namespace std;
typedef long long ll;
int N,M;
ll fac[MAXN], ifac[MAXN];
ll qpow(ll x, int n){
ll res = 1;
while(n){
if(n&1) res = res * x % P;
x = x * x % P;
n /= 2;
}
return res;
}
void init(){
fac[0] = ifac[0] = 1;
for(int i=1;... | #include<bits/stdc++.h>
using namespace std;
int n, a[610][610];
void solve(int d)
{
int num = 0;
while(d % 4 == 0)
{
d /= 4;
++num;
}
if(d % 4 == 1)
{
for(int i = 0; i < 2 * n; ++i)
for(int j = 0; j < 2 * n; ++j)
if(((i >> num) + (j >> num)) & 1) a[i][j] = 1;
}
else
{
for(int i = 0; i < 2 * n... | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n, m, x, y;
cin >> n >> m >> x >> y;
vector<int> xv(n);
vector<int> yv(m);
int xmax = x;
int ymin = y;
rep(i, n) {
cin >> xv[i];
xmax =... | #include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
void Input(int*,int*);
int Calc(int*,int*);
void Output(int*,int*,int*);
int main(int argc,char* argv[]){
int n,count=0;
int arr[100];
Input(&n,arr);
count=Calc(&n,arr);
Output(&n,&count,arr);
return 0;
}
voi... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
#define int ll
main(){
ll a,b;
int k;
cin >> a >> b >> k;
for(int i=0;i<k;i++){
if(i%2==0){
a -= a%2;
b += a/2;
a -= a/2;
}else{
b -= b%2;
a += b/2;
b -= b/2;
}
}
cout << a << " " << b << e... | #include <bits/stdc++.h>
#define repp(i,l,r)for(long long i=(l);i<(r);i++)
#define rep(i,n) for (long long i = 0; i < (n); ++i)
#define per(i,n) for (long long i = (n); i >= 0; --i)
const int INF = 2147483647;//int max
const long long int MOD = 1000000007;
using namespace std;
using ll = long long;
using P = pair<int,i... | 0 |
#include <iostream>
#include <vector>
#include <string>
using namespace std;
class XorBase {
public:
explicit XorBase(){}
long long reduce(long long t) const {
for(auto& b : base) t = min(t, t^b);
return t;
}
bool add(long long t){
t = reduce(t);
if(!t) return false;
... | #include<bits/stdc++.h>
using namespace std;
int n;
int a[225];
int main(){
cin>>n;
for(int i=1;i<=2*n;i++)cin>>a[i];
sort(a+1,a+2*n+1);
int summ=0;
for(int i=2*n;i>=1;i-=2){
summ+=a[i-1];
}
cout<<summ;
} | 0 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using LL = long long;
using P = pair<int,int>;
int main(){
string S;
cin >> S;
if(S.size()==2) {
cout << S << endl;
}
else cout << S[2] << S[1] << S[0] << endl;
}
| #include<bits/stdc++.h>
using namespace std;
int main(){
int N,t;
cin >> N;
t=N;
int f=0;
for(int i=0;i<9;i++){
f = f+ (t%10);
t=t/10;
}
if(N%f==0)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
} | 0 |
#include <bits/stdc++.h>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define size_of_array(array) (sizeof(array)/sizeof(array[0]))
using ll =long long;
using namespace std;
using Graph=vector<vector<int>>;
using Field=vector<vector<int>>;
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;... | // lcmとか__builtin_popcountとかはg++ -std=c++17 default.cppみたいなかんじで
#include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define NO cout<<"NO"<<endl
#define YES cout<<"YES"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll ... | 1 |
#include <map>
#include <set>
#include <cmath>
#include <queue>
#include <stack>
#include <cctype>
#include <cstdio>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>
#define INF (2 << 28)
#define fr first
#define... | #include <iostream>
#include <algorithm>
#include <map>
#include <string>
#include <set>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <bitset>
#include <random>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <complex>
#include <functional>
using namespace std;
#define ... | 0 |
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>... | #include<iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int main() {
char str[20];
int i, len=0;
cin >> str;
while (str[len])
len++;
for (i = len - 1; i >= 0; i--)
cout << str[i];
putchar('\n');
return 0;
} | 0 |
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define str to_string
#define endl "\n"
#define PI 3.141592653589
using namespace std;
using lint = long long;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size... | #include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rrep(i,n) for(ll i = 1; i <= (n); ++i)
#define drep(i,n) for(ll i = (n)-1; i >= 0; --i)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define pb push_back
#define sz(x... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(),(x).end()
#define COUT(x) cout<<(x)<<"\n"
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define REP(i, n) for(int i=0;i<n;i++)
#define YES(x) cout<<(x?"YES":"NO")<<"\n"
#define Yes(x) cout<<(x?"Yes":"No")<<"\n"
#define dump(x) cout... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main() {
int n;
long long int ans = 3;
cin >> n;
int a[n], rgb[3] = {0};
for(int i = 0; i < n; ++i) {
cin >> a[i];
}
if(a[0] != 0) {
cout << 0 << '\n';
return 0;
}
rgb[0] = 1;
for(int i =... | 1 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii v... | #include<iostream>
#include<cstdio>
int main() {
int n;
std::cin >> n;
printf("%d\n", n * n * n);
return 0;
} | 0 |
#include <iostream>
#include <algorithm>
using namespace std;
const int MAX_N = 205;
int arr [MAX_N];
int main () {
int n;
cin >> n;
n *= 2;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
sort(arr, arr + n);
int ans = 0;
for (int i = 0; i < n; i += 2) {
ans += arr[i];
}
cout << ans <... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int a[2*n];
for(int i=0;i<2*n;i++)
cin>>a[i];
sort(a,a+2*n);
int sum=0;
for(int i=0;i<2*n-1;i+=2)
sum+=min(a[i],a[i+1]);
cout<<sum;
} | 1 |
#include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL (-1)
#define LL long long
using namespace std;
const int64_t MOD = 1e9 + 7;
const int INF = INT_MAX;
int main() {
int N;
cin >> N;
vector<int> A(N), v(N);
for (int i = 0; i < N; i++) cin >> A[i];
vector<int> C;
for (int i = N - 1; i >= 0; i--) {
i... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#in... | 1 |
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define INF 1000000000000000000
long long GCD(long long a, long long b) {
if (b == 0)
return a;
else
return GCD(b, a... | #include "bits/stdc++.h"
using namespace std;
///////////////////////////////////////////
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using LL = long long;
using P = pair<int,int>;
int main(){
int N, K;
cin >> N >> K;
int ans = 0;
for(int i = 1; i <= N - K + 1; ++i) {
ans++;
}
cout << ans << endl;
}
| #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
#define rep1(i, n) for(int i=1; i<=n; i++)
#define repr(i, n) for(int i=n-1; i>=0; i--)
#define repr1(i, n) for(int i=n; i>=1; i--)
#define all(v) v.begin(),v.end()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<in... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod = int(1e9)+7;
using V = vector<ll>;
using P = pair<ll,ll>;
int main()
{
string s;cin >>s;
if(s.size()==3)... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
template<class T> inline bool chmax(T &a, T b) {if (a < b) {a = b;return 1;}return 0;}
template<class T> inline bool chmin(T &a, T b) {if (a > b) {a = b;return 1;}return 0;}
int main(){
string s; cin>>s;... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
string s;
int cnt = 0;
cin >> s;
if (s[0] != 'A')
{
cout << "WA" << endl;
return 0;
}
for (int i = 1; i < s.length(); i++)
{
if (i > 1 && i < s.length() - 1)
{
if (s[i] == 'C')
{
if (c... | #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()
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD = 1e9+7, INF = 1e9;
int main()
{
string s; cin >> s;
int n = s.size();
if(s == "zyxwvutsrqponmlkjihgfedcba") {
cout << -1 ... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
/*
*/
int main() {
string S;
cin >> S;
bool flag = false;
for(int i = 0;i<S.size()-1;i++){
if(S[i] == 'A' && S[i+1] == 'C'){
flag = true;
break;
}
}
if(... | #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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
int main() {
ll n, m, i, j, k;
cin >> n >> m;
vector<ll> x(n), y(m);
for(i = 0; i < n; i++) {
cin >> x[i];
}
for(i = 0; i < m; i++) {
cin >> y[i];
}
ll retx... | #include<bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define all(v) (v).begin(),(v).end()
using ll=long long;
using ld=long double;
using pii=pair<int, int>;
using vi=vector<int>;
using vii=vector<vector<int>>;
const ll LINF=1LL<<60;
const int INF=1<<29;
const int MOD=1e9+7;
struct edge{int to, cost;}... | 0 |
#include<bits/stdc++.h>
using namespace std;
main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long i,j,k,l,m,n,o,p,q;
while(cin>>m>>n>>o>>p)
{
if(m+n>o+p)
cout<<"Left"<<endl;
else if(m+n<o+p)
cout<<"Right"<<endl;
else
co... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int a, b, c, d;
cin >> a >> b >> c >> d;
int left = a + b, right = c + d;
if (left > right) cout << "Left" << "\n";
else if (left < right) cout << "Right" << "\n";
else cout << "B... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int f = 0, j = 1;
while(N >= (j / 10)){
j *= 10;
f += N % j / (j / 10);
}
if (N % f == 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (int i=(int)from; i<(int)to; i++)
#define all(vec) vec.begin(), vec... | 0 |
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1000010;
const int64_t MOD = 1000000007;
int64_t fac[MAX], finv[MAX], inv[MAX];
void COMinit()
{
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++)
{
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD ... | #include <bits/stdc++.h>
using namespace std;
vector<int> primes={2,3,5,7};
int primes_extend(int calc_from, int calc_to);
int factoring(int n, map<int,int> &factors);
const int combination_max=100000+1000;
const int combination_modulo=1000000007;
vector<int64_t> factorials(combination_max);
vector<int64_t> factorial... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll unsigned long long int
#define mod 1000000007
bool isPrime[1000001];
ll power(ll a,ll b)
{
ll result = 1;
while(b>0)
{
if(b%2)
{
result = (a*result)%mod;
}
a = (a*a)%mod;
b = b/2;
}
return re... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define all(a) a.begin(), a.end()
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<ll,int> pli;
typedef pair<int,int> pii;
#define rep(i,a,b) for(ll i=a ; i<b ; i++)
#define qrep(que, ite)... | 1 |
#include <bits/stdc++.h>
#define de(x) cout << #x << "=" << x << ", "
#define dd cout << '\n';
#define XinAi ios::sync_with_stdio(0), cin.tie(0);
#define F first
#define S second
using namespace std;
typedef pair<int,int> pii;
const int N = 1e4+10;
string dp[N], val[15];
string num = "123456789";
int c[] = {2,5,5,4,5,... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (i... | 0 |
#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()
{
ll n;
cin >> n;
vector<ll> a(n);
vector<ll> b(n);
vector<ll> c(n);
rep(i, n) cin >> a[i];
rep(i, n) cin >> b[i];
rep(i, n) cin >> c[... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N,cnt = 0;
cin >> N;
int bubble[N];
for(int i=0;i<N;i++){
cin >> bubble[i];
}
double flag = true;
while(flag){
flag = false;
for(int j=N-1;j>=1;j--){
if(bubble[j] < bubble[j-1]){
swap(bubble[j],bubble[j-1]);
cnt++;
flag =... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll,ll>
#define left 2*node+1
#define right left+1
#define mid (s+e>>1)
const ll N=5e5+5;
vector<ll> T[4*N];
void build(ll A[], ll node, ll s, ll e){
if(s==e){
T[node].push_back(A[s]);
return;
}
build(A, left, s, mid);
build(... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int D, G, p[11], c[11];
cin >> D >> G;
for (int i = 0; i < D; ++i)
cin >> p[i] >> c[i];
int ans = 1e9;
for (int mask = 0; mask < 1 << D; ++mask)
{
int sum = 0, num = 0;
for (int i = 0; i < D; ++i)
{
if (mask & 1 << i)
{
sum += (i + 1) ... | 0 |
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
int n, k;
int a[10];
int v[10000] = {};
int s;
void set_vec(int t, int f, int sum) {
if(t>=k) {
v[s] = sum;
s++;
}else {
for(int i=0;i<n;i++) {
if((1<<i) & f)continue;
set_vec(t+1, f+(1<<i), sum*(a[i]<10?10:100)+a[i]);
}
}
... | #include <cstdio>
int main(){
int n, table[20][20];
while( scanf("%d", &n) , n ){
for(int i=0 ; i<20 ; i++){
for(int j=0 ; j<20 ; j++){
table[i][j] = 0;
}
}
for(int i=0 ; i<n ; i++){
for(int j=0 ; j<n ; j++){
scanf("%d", &table[i][j]);
}
}
for(int i=0 ; i<n ; i++){
for(int j=0 ; j<n... | 0 |
#include <iostream>
#include <iomanip>
using namespace std;
int main()
{
int size;
cin >> size;
long long a[size];
int i;
for(i=0; i<size; i++){
cin >> a[i];
}
long long max=0;
for(i=0; i<size; i++){
if(max < a[i] || i==0){
max = a[i];
}
e... | #include <stdio.h>
const static int MAX = 100;
void print(int *array, int n){
for(int i=0;i<n;i++){
printf("%d", array[i]);
if(i<n-1) printf(" ");
}
printf("\n");
}
int bubble_sort(int *array, int n){
bool flag = true;
int k, count=0;
while(flag){
flag = false;
... | 0 |
#include <iostream>
#include <algorithm>
#include <map>
#include <vector>
#include <string>
#include <cstdio>
#include <cmath>
using namespace std;
int c[5];// card
bool straight()
{
if(c[4]==13 && c[3]==12 && c[2]==11 && c[1]==10 && c[0]==1)
return true;
for(int i=0; i<4; i++) {
if(c[i+1] - c... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <string>
#define rep(x,to) for(int x=0;x<to;x++)
#define rep2(x,from,to) for(int x=from;x<to;x++)
using namespace std;
int main(void){
int cd[5]={0},cnt=0;
char k;
while(!cin.eof()){
cin >> cd[0] >> k >>cd[1] >>k >>cd[2] >>k ... | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.