content
stringlengths 19
11k
|
|---|
/* ex9_1
suzuto */
#include <stdio.h>
#include <stdlib.h>
#define SIZE 10
typedef struct stack{ /*入力した文字をスタックとして重ねていくための構造体を作る*/
int size;
int count;
char inp_str[SIZE];
char *top;
}stack;
/*プロトタイプ宣言*/
void initialize_stack(stack *stack_ptr);
void push(stack *stack_ptr, char add_elem);
char pop(stack *stack_ptr);
int main(void){
stack inp_stack, res_stack; /*変数の宣言*/
char inp[SIZE + 1], ins;
int i;
initialize_stack(&inp_stack); /*inp_stackを初期化*/
initialize_stack(&res_stack); /*res_stackを初期化*/
scanf("%s", &inp); /*入力内容を記憶*/
for(i = 0; i < SIZE + 1; i++){
ins = inp[i]; /*i + 1番目の入力取り出し*/
if(ins == '\0'){ /*末尾の識別*/
break;
}
if(ins == 'B'){ /*バックスペースの時、スタックから一番上=最後に入力した文字を取り出す*/
pop(&inp_stack);
}
else{
push(&inp_stack, ins); /*文字入力の時、スタックの一番上に追加*/
}
}
while (inp_stack.count > 0){ /*inp_stackの中身を全て(逆順に)res_stackに移し替える*/
push(&res_stack, pop(&inp_stack));
}
while (res_stack.count > 0){ /*res_stackの中身を上から順に取り出していって答えを出力*/
putchar(pop(&res_stack));
}
printf("\n"); /*改行*/
return 0;
}
void initialize_stack(stack *stack_ptr){ /*スタックを初期化する関数*/
stack_ptr->count = 0; /*要素の数 = 0*/
stack_ptr->size = SIZE;
stack_ptr->top = &(stack_ptr->inp_str[SIZE]); /*スタックの底に頂点を合わせる*/
}
void push(stack *stack_ptr, char add_elem){ /*スタックに要素を追加する関数*/
if(stack_ptr->count >= stack_ptr->size){ /*スタックをあふれた時のエラー出力*/
fprintf(stderr, "Error: stack overflow.\n");
exit(1);
}else{ /*頂点の位置を1つ上げて、その位置に要素を積む*/
stack_ptr->top--;
*(stack_ptr->top) = add_elem;
stack_ptr->count++;
}
}
char pop(stack *stack_ptr){
char output_elem;
if(stack_ptr->count <= 0){ /*スタックの底が尽きている時には何も取り出さない*/
return 'B'; /*意味のない仮の出力*/
}else{ /*一番上の要素を取り出し、頂点を一個下げる*/
output_elem = *(stack_ptr->top);
stack_ptr->count--;
stack_ptr->top++;
return output_elem;
}
}
|
/* ex9_1
B30095 */
#include <stdio.h>
#include <stdlib.h>
// stack size
#define SIZE 1000
// definition of stack
typedef struct stack{
int size; // stack size
int count; // number of data
char data[SIZE];
char *top;
} stack;
void print_stack_from_bottom(stack *stk);
void initialize_stack(stack *stk);
char pop(stack *stk);
void push(stack *stk, char elem);
int main(void){
stack stk;
char ch;
initialize_stack(&stk);
// process input with stack
while(1){
ch = getchar();
if(ch == '\n' || ch == EOF || ch == '\0') break; /// end loop if the end of input is reached
if(ch == 'B'){
if(stk.count > 0){
pop(&stk); // pop an element if backspace is entered and stack is not empty
}
}
// push to stack if character other than backspace is entered
else{
push(&stk, ch);
}
}
// print out the stack
print_stack_from_bottom(&stk);
return 0;
}
void print_stack_from_bottom(stack *stk){
int i;
for(i = 0; i < stk->count; i++){
putchar(stk->data[stk->size - i - 1]);
}
}
// initialize a stack to be empty
void initialize_stack(stack *stk){
stk->count = 0;
stk->size = SIZE;
stk->top = &(stk->data[SIZE]); // top is at the end of the array
}
// stack push operation
void push(stack *stk, char elem){
if(stk->count >= stk->size){ // stack overflow
fprintf(stderr, "Error: stack overflow. (x=%c)\n", elem);
exit(1);
}
else{ // push an element
stk->top--;
*(stk->top) = elem;
stk->count++;
}
}
// stack pop operation
char pop(stack *stk){
char latest;
if(stk->count <= 0){ // stack underflow
fprintf(stdout, "Error: stack underflow.\n");
exit(1);
}
else{ // pop an element
latest = *(stk->top);
stk->top++;
stk->count--;
return latest;
}
}
|
/* ex9_1
Rikuta */
#include <stdio.h>
//スタックに格納するデータの最大数
#define SIZE 10
//スタックの定義
typedef struct stack
{
int size;
int count;
char data[SIZE];
char *top;
} stack;
//スタックの初期化
void initialize_stack(stack *string);
//データの追加
void push(stack *string, char elem);
//データの取り出し
void pop(stack *string);
//stackの出力
void print_stack(stack *string);
int main(void)
{
//スタックを宣言
stack string;
//スタックを初期化
initialize_stack(&string);
while (1)
{
//受け取る変数の宣言
char temp_char;
//入力
scanf("%c", &temp_char);
//入力が終了なら終わり
if (temp_char=='\n')
{
break;
}
//Bが入力されたらスタックをpop
if (temp_char=='B')
{
pop(&string);
}
//0,1ならそれをスタックにpush
if (temp_char=='0'||temp_char=='1')
{
push(&string, temp_char);
}
}
//スタックを出力
print_stack(&string);
return 0;
}
//スタックの初期化
void initialize_stack(stack *string)
{
//スタックの要素数と最大の大きさとtopを初期化
string->count = 0;
string->size = SIZE;
string->top = &(string->data[SIZE]);
}
//データの追加
void push(stack *string, char elem)
{
//スタックの長さが最大を超えていたら標準エラー出力
if (string->count >= string->size)
{
fprintf(stderr, "Error: stack overflow. (x=%c)\n", elem);
exit(1);
}
else
{
//スタックのtopは一個戻り，戻ったtopに要素が入る．要素数が1増える．
string->top--;
*(string->top) = elem;
string->count++;
}
}
//データの取り出し
void pop(stack *string)
{
//データに何も入っていなかったら
if (string->count > 0)
{
//スタックのトップを奥へ，要素数が1減る
string->top++;
string->count--;
}
}
void print_stack(stack *string)
{
//ポインタの宣言
char *pointer;
//ポインタはスタックの一番古い要素を指す
pointer = string->top+string->count-1;
for (int i = 0; i < string->count; i++)
{
//ポインタがさす要素を新しくしながら出力していく．
printf("%c", *(pointer--));
}
//改行
printf("\n");
}
|
s[201],a,i;main(){for(scanf("%*d");~scanf("%d",&a);)for(i=-101;++i<101;s[i+100]+=(a-i)*(a-i));for(a=1e9,i=201;i--;a=a<s[i]?a:s[i]);printf("%d\n",a);}
|
#include<stdio.h>
int main(){
int s=0,p=0,n,x,t;
double a;
scanf("%d",&n);
for(int i=0;i<n;i++){scanf("%d",&t);s+=t;p+=t*t;}
a=(double)s/n;
x=a;
x+=(a-(double)x)>=0.5;
printf("%d",n*x*x+p-2*x*s);
}
|
#include <stdio.h>
int main() {
int a[110], sum = 0, sum2 = 0, n, m;
scanf("%d", &n);
for (int i = 0; i < n; i++)
{
scanf("%d", &a[i]);
sum += a[i] + 100;
sum2 += (a[i] + 100) * (a[i] + 100);
}
m = (n + 2 * sum) / (2 * n);
printf("%d", sum2 - 2 * sum*m + m*m*n);
return 0;
}
|
#include<stdio.h>
#include<math.h>
void main(){
int N;
scanf("%d",&N);
int data[N],res,ave;
double sum;
sum=res=0;
for(int i=0;i<N;i++){
scanf("%d",&data[i]);
sum+=data[i];
}
ave=(int)round(sum/N);
for(int i=0;i<N;i++){
res+=(ave-data[i])*(ave-data[i]);
}
printf("%d",res);
}
|
#include<stdio.h>
int main(void){
int s[102],a[12];
int i,n,t=0,c=0,g,h,r=0,e=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&s[i]);
t+=s[i];
}
g=t/n;
h=(t)/n+1;
//printf("%d %d.\n",g,h);
for(i=0;i<n;i++){
r+=(s[i]-g)*(s[i]-g);
e+=(s[i]-h)*(s[i]-h);
}
if(r>e)printf("%d\n",e);
else printf("%d\n",r);
return 0;
}
|
# include"stdio.h"
# include"math.h"
int main(){
int n;
scanf("%d",&n);
double sum=0;
int a[n];
for(int i=0;i<n;i++){
scanf("%d",&a[i]);
sum += a[i];
}
int med = (int)round(sum/n);
int sc=0;
for(int i=0;i<n;i++){
sc += (med-a[i])*(med-a[i]);
}
printf("%d\n",sc );
}
|
#include<stdio.h>
//using namespace std;
int main() {
int i,j,n, a[100];
scanf("%d", &n);
for (i = 0; i < n; i++) scanf("%d", &a[i]);
int min = 5000000, temp = 0;
for (j = -100; j <= 100; j++) {
temp = 0;
for (i = 0; i < n; i++) temp += (a[i] - j)*(a[i] - j);
if (min > temp) min = temp;
}
printf("%d\n", min);
return 0;
}
|
#include<stdio.h>
int main(void)
{
int a,b[1001],x=0,x1=10000,X=100000000,cnt,i,j;
scanf("%d",&a);
for(i=0;i<a;i++){
scanf("%d",&b[i]);
if(x<b[i]){
x=b[i];
}
if(x1>b[i]){
x1=b[i];
}
}
for(i=x1;i<=x;i++){
cnt=0;
for(j=0;j<a;j++){
cnt+=(b[j]-i)*(b[j]-i);
}
if(X>cnt){
X=cnt;
}
}
printf("%d\n",X);
return 0;
}
|
#include<stdio.h>
#include<math.h>
#include<stdlib.h>
int main()
{
int N,*a;
int cost,MIN=10000000;
scanf("%d",&N);
a=(int*)malloc(sizeof(int)*N);
for(int i=0;i<N;i++)
scanf("%d",&a[i]);
for(int i=-100;i<=100;i++){
cost=0;
for(int j=0;j<N;j++){
cost+=pow(a[j]-i,2);
}
if(MIN>cost) MIN=cost;
}
printf("%d",MIN);
return 0;
}
|
#include<stdio.h>
int main(){
int n;
scanf("%d",&n);
int a[n],i;
int av=0,cost1=0,cost2=0;
for(i=0;i<n;i++){
scanf("%d",&a[i]);
av += a[i];
}
av /= n;
int av2= av+1;
for(i=0;i<n;i++){
cost1 += (a[i]-av)*(a[i]-av);
cost2 += (a[i]-av2)*(a[i]-av2);
}
printf("%d",(cost1<cost2?cost1:cost2));
return 0;
}
|
#include<stdio.h>
int main(){
int n;
scanf("%d\n",&n);
int i,arr[n],sum=0;
for(i=0;i<n;i++){
scanf("%d ",&arr[i]);
sum = sum+arr[i];
}
int av1 = sum/n;
int av2 = sum/n +1;
int cost1=0,cost2=0;
for(i=0;i<n;i++){
cost1 = cost1+(arr[i]-av1)*(arr[i]-av1);
cost2 = cost2+(arr[i]-av2)*(arr[i]-av2);
}
if(cost1<cost2) printf("%d\n",cost1);
else printf("%d\n",cost2);
return 0;
}
|
int main(){
int N;
scanf("%d",&N);
int a[N];
for(int i=0;i<N;i++){
scanf("%d",&a[i]);
}
int temp,min;
for(int i=-100;i<=100;i++){
int sum=0;
for(int j=0;j<N;j++){
sum+=(a[j]-i)*(a[j]-i);
}
if(i==-100){
min=sum;
temp=sum;
}else{
temp=sum;
}
if(temp<min){
min=temp;
}
}
printf("%d\n",min);
return 0;
}
|
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#include<limits.h>
int main() {
int loop;
int N;
int *a;
int x, y;
int sum;
int best;
scanf("%d", &N);
a = malloc(sizeof(int)*N);
best = INT_MAX;
for (loop = 0; loop < N; loop++) {
scanf("%d", &a[loop]);
}
for (x = -100; x <= 100; x++) {
sum = 0;
for (y = 0; y < N; y++) {
sum += pow(x - a[y], 2);
}
if (sum < best)
best = sum;
}
printf("%d", best);
return 0;
}
|
#include <stdio.h>
int Cost(int N, int s, int a[N]){
int i, cost;
cost = 0;
for(i = 0;i < N;i++) cost += (s - a[i]) * (s - a[i]);
return cost;
}
void Do(int N){
int i, s;
int a[N];
double S;
S = 0;
for(i = 0;i < N;i++){
scanf("%d", &a[i]);
S += a[i];
}
S /= N;
if(S - (int) S >= 0.5) s = (int) S + 1;
else s = (int) S;
printf("%d\n", Cost(N, s, a));
}
int main(void){
int N;
scanf("%d", &N);
Do(N);
return 0;
}
|
#include <stdio.h>
int main (void){
long long N,i,j,k;
long long A[101],B[101];
long long sum = 0;
long long min=1000000000;
scanf("%lld",&N);
for(i=0;i<N;i++){
scanf("%lld",&A[i]);
}
for(i=-100;i<=100;i++){
for(j=0;j<N;j++){
B[j] = (A[j]-i)*(A[j]-i);
sum +=B[j];
}
if(min>sum){
min=sum;
//printf("%lld\n",min);
}
sum=0;
}
printf("%lld",min);
return 0;
}
|
#include<stdio.h>
#include<stdlib.h>
int N, *a;
int ave=0;
void input(){
scanf("%d",&N);
a=(int*)malloc(N);
int i;
for(i=0;i<N;i++){
scanf("%d", &a[i]);
ave+=a[i];
}
ave=ave/N;
}
int main(){
int i, cost1=0, cost2=0;
input();
for(i=0; i<N;i++) cost1+=(a[i]-ave)*(a[i]-ave);
for(i=0; i<N;i++) cost2+=(a[i]-ave-1)*(a[i]-ave-1);
if(cost1<cost2) printf("%d\n",cost1);
else printf("%d\n",cost2);
return 0;
}
|
#include <stdio.h>
int min(int a, int b, int c){
int min = (a<b) ? a:b;
return (min<c) ? min : c;
}
int main()
{
int N;
scanf("%d", &N);
int a[N], sum=0;
for(int i=0;i<N;i++){
scanf("%d", &a[i]);
sum += a[i];
}
int c1=0, c2=0, c3=0;
for(int i=0;i<N;i++){
c1 += (a[i] - sum/N) * (a[i] - sum/N);
c2 += (a[i] - sum/N + 1) * (a[i] - sum/N + 1);
c3 += (a[i] - sum/N - 1) * (a[i] - sum/N - 1);
}
printf("%d", min(c1,c2,c3));
return 0;
}
|
#include<stdio.h>
int main(){
int N, i, ave, val;
int ret, b;
ret = 0;
b = 0;
scanf("%d\n", &N);
int a[N];
for(i = 0; i < N; i++){
scanf("%d",&a[i]);
ave += a[i];
}
ave = ave/N;
for(i = 0; i < N; i++){
val = (a[i] - ave);
ret += val*val;
}
for(i = 0; i < N; i++){
val = (a[i] - ave - 1);
b += val*val;
}
if(ret > b) ret = b;
b = 0;
for(i = 0; i < N; i++){
val = (a[i] - ave + 1);
b += val*val;
}
if(ret > b) ret = b;
printf("%d\n", ret);
return 0;
}
|
#include <stdio.h>
long long MIN(long long a,long long b){
if(a<b)return a;
return b;
}
int main()
{ int n;
scanf("%d",&n);
int a[n],sum=0;
for(int i=0;i<n;i++){
scanf("%d",&a[i]);
sum+=a[i];
}
long long ans1=0,ans2=0,ans3=0;
int ave=sum/n,avep=ave+1,aven=ave-1;
for(int i=0;i<n;i++){
ans1+=((a[i]-ave)*(a[i]-ave));
ans2+=((a[i]-avep)*(a[i]-avep));
ans3+=((a[i]-aven)*(a[i]-aven));
}
printf("%lld",MIN(ans1,MIN(ans2,ans3)));
return 0;
}
|
#include <stdio.h>
int fun(int A[]){
int min = A[0];
int i = 0;
for(i = 1; i < 201; i++){
if(A[i] < min) min = A[i];
}
return min;
}
int main (void){
int i,j;
int n = 0;
int sum[202] = {0};
scanf("%d", &n);
int array[n];
for(i = 0; i < n; i++){
scanf("%d", &array[i]);
}
for(i = -100; i <= 100; i++){
for(j = 0; j < n; j++) {
sum[i+100] += (array[j] - i)*(array[j] - i);
}
}
printf("%d\n", fun(sum));
return 0;
}
|
#include <stdio.h>
#define CALC(a, b) (((a)-(b))*((a)-(b)))
int Num[110];
int N;
int main(void) {
int i, j, tmp;
int min = 300, max = -300;
int tot_min = 987654321;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &tmp);
Num[i] = tmp;
if (tmp < min) min = tmp;
if (tmp > max) max = tmp;
}
for (i = min; i <= max; i++) {
tmp = 0;
for (j = 0; j < N; j++) {
tmp += CALC(Num[j], i);
if (tmp > tot_min) break;
}
if (j == N) tot_min = tmp;
}
printf("%d\n", tot_min);
return 0;
}
|
#include <stdio.h>
#define MAX_N 100
int main(){
int N, a[MAX_N];
int heikin, sum=0, i;
int cost=0;
scanf("%d", &N);
for (i=0; i<N; i++)
scanf("%d", &a[i]);
for (i=0; i<N; i++)
sum += a[i];
if (sum % N == 0) heikin = sum/N;
else {
if ((double)sum/N - sum/N < 0.5)
heikin = sum/N;
else
heikin = sum/N + 1;
}
for (i=0; i<N; i++){
cost += (a[i]-heikin)*(a[i]-heikin);
}
printf("%d\n", cost);
return 0;
}
|
#include<stdio.h>
int main(void)
{
int i,j,n,a[100],cst[300],max,min,min2,sum,cnt;
scanf("%d",&n);
for(i=0;i<n;i++) scanf("%d",&a[i]);
// for(i=0;i<n;i++) printf("%d\n",a[i]);
max=-101;
for(i=0;i<n;i++){
if(max<a[i]) max=a[i];
}
min=101;
for(i=0;i<n;i++){
if(min>a[i]) min=a[i];
}
cnt=0;
for(i=min;i<=max;i++){
sum=0;
for(j=0;j<n;j++){
sum+=(a[j]-i)*(a[j]-i);
}
cst[cnt]=sum;
cnt++;
}
// for(i=0;i<cnt;i++) printf("%d\n",cst[i]);
min2=10000000;
for(i=0;i<cnt;i++){
if(min2>cst[i]) min2=cst[i];
}
printf("%d\n",min2);
return 0;
}
|
#include<stdio.h>
int main(){
int max, min;
int read[1000];
int n;
int ans=1000000,tmp;
int i,j;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&read[i]);
if(i == 0){
max = read[0];
min = read[0];
}
//printf("%d ",read[i]);
if(read[i] > max){
max = read[i];
}else if(read[i] < min){
min = read[i];
}
}
//printf("max=%d,min=%d\n",max,min);
for(i=min;i<=max;i++){
for(j=0;j<n;j++){
tmp += (read[j] - i)*(read[j] - i);
}
if(tmp<ans){
ans = tmp;
}
tmp = 0;
}
printf("%d\n",ans);
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
int compare(const void *n1, const void *n2){
if(*(int *)n1 > *(int *)n2)
return 1;
else if(*(int *)n1 < *(int *)n2)
return -1;
else
return 0;
}
int main(void){
int min = 1 << 29;
int n, temp;
int num[100] = {0};
scanf("%d", &n);
for(int i=0; i < n; i++) {
scanf("%d", &num[i]);
}
qsort(num, n, sizeof(num[0]), compare);
if(num[0] == num[n-1]) {
printf("0");
return 0;
}
for(int i=num[0]; i < num[n-1]; i++) {
temp = 0;
for(int j=0; j < n; j++) {
temp += (i - num[j])*(i - num[j]);
}
if(min > temp)
min = temp;
}
printf("%d", min);
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <stdbool.h>
#include <math.h>
int main(void){
int n,min=101,max=-101;
scanf("%d",&n);
int a[n];
for (int i=0; i<n; i++){
scanf("%d",&a[i]);
if (max<a[i]){
max=a[i];
}
if (min>a[i]){
min=a[i];
}
}
long long ans;
for (int i=min; i<=max; i++){
int tmp=0;
for (int j=0; j<n; j++){
int tmp1,tmp2;
tmp1=a[j]-i;
tmp2=tmp1*tmp1;
tmp+=tmp2;
}
if (i==min || ans>tmp){
ans=tmp;
}
}
printf("%lld\n",ans);
return 0 ;
}
|
#include<stdio.h>
#include<stdlib.h>
#define kai(a) (a)*(a)
int min(int a[],int n){
int ret;
ret=a[0];
for(int i=1;i<n;i++){
if(a[i]<=ret) ret=a[i];
}
return ret;
}
int max(int a[], int n){
int ret=a[0];
for(int i=1;i<n;i++){
if(a[i]>=ret) ret=a[i];
}
return ret;
}
int main(){
int n;
int *a;
int *sum;
scanf("%d",&n);
a=calloc(n,sizeof(int));
sum=calloc(max(a,n)-min(a,n)+1,sizeof(int));
for(int i=0;i<n;i++){
scanf("%d",&a[i]);
}
int j=0;
for(int i=min(a,n);i<=max(a,n);i++){
int ssum=0;
for(int k=0;k<n;k++){
ssum+=kai(a[k]-i);
}
sum[j++]=ssum;
}
printf("%d",min(sum,max(a,n)-min(a,n)+1));
printf("\n");
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#define MAX(a,b) (a > b) ? a : b
#define MIN(a,b) (a < b) ? a : b
const int inf = 1000000000; // 10^9
int Amax(int *p,int size){
int _max = 0;
for(int i = 0;i < size;i++)
if(p[i] > _max)_max = p[i];
return _max;
}
int Amin(int *p,int size){
int _min = 0;
for(int i = 0;i < size;i++)
if(p[i] < _min)_min = p[i];
return _min;
}
int main(){
int n;scanf("%d",&n);
int a[100];
for(int i = 0;i < n;i++)scanf("%d",&a[i]);
int ans = inf;
for(int i = Amin(a,n);i < Amax(a,n)+1;i++){
int _ans = 0;
for(int j = 0;j < n;j++){
_ans += pow(abs(a[j] - i),2);
}
//printf("MIN(%d,%d)\n",ans,_ans);
ans = MIN(ans,_ans);
//printf("%d:%d\n",i,ans);
}
printf("%d\n",ans);
}
|
#include <stdio.h>
#include <stdlib.h>
#define absmin(a,b) (((a) > 0) &&
int main(void) {
int N;
int a[100];
int i,cnt;
char str[512];
char *p;
int rd=0,ru=0,minus=0 ;
int rdchk=0,ruchk=0,minux=0;
fgets(str, 512, stdin);
N = atoi(str);
fgets(str, 512, stdin);
p = str;
for(i=0,cnt=0;i<512;i++){
if(str[i] == ' '){
str[i] = '\0';
a[cnt++] = atoi(p);
p = &str[i+1];
}
}
a[cnt] = atoi(p);
for(cnt=0;cnt<N;cnt++){
rd +=a[cnt];
}
rd = rd / N;
ru = rd + 1;
minus = rd - 1;
for(cnt=0;cnt<N;cnt++){
rdchk += (a[cnt] - rd) * (a[cnt] - rd);
ruchk += (a[cnt] - ru) * (a[cnt] - ru);
minux += (a[cnt] - minus) * (a[cnt]-minus);
}
if(rdchk > ruchk) {
if(ruchk > minux) {
printf("%d\n", minux);
} else {
printf("%d\n", ruchk);
}
} else {
if(rdchk > minux) {
printf("%d\n", minux);
} else {
printf("%d\n", rdchk);
}
}
return 0;
}
|
#include<stdio.h>
int main(){
int list[100000];
int n;
int i,j,k;
char s[100001];
scanf("%s",s);
for(i=0;i<26;i++){
n=0;
for(j=0;s[j]!='\0';j++)if(s[j]=='a'+i){list[n]=j+1;n++;}
for(j=0;j<n;j++)for(k=j+1;k<n;k++)if(list[k]-list[j]+1<(k-j+1)*2){printf("%d %d",list[j],list[k]);return 0;}
}
printf("-1 -1");
}
|
#include <stdio.h>
char ch[100001];
int a, b;
int main(void)
{
int i;
scanf("%s", ch);
if (ch[2] || ch[0] != ch[1]) a = b = -1;
else a = -1 + (b = 2);
for (i = 2; ch[i]; ++i)
{
if (ch[i-2] != ch[i-1] && ch[i-1] != ch[i] && ch[i-2] != ch[i]) continue;
a = i-1;
b = i+1;
break;
}
printf("%d %d\n", a, b);
return 0;
}
|
#include <stdio.h>
#include <string.h>
char s[100000];
int alphabet[26];
int len;
int check(int x){
int i;
for(i=0;i<26;i++){
if(alphabet[i]>x/2)return 1;
}
return 0;
}
int main(){
int i,j,k;
scanf("%s",s);
len=strlen(s);
for(i=0;i<len-1;i++){
if(s[i]==s[i+1]){
printf("%d %d\n",i+1,i+2);
return 0;
}
}
for(i=1;i<len-1;i++){
if(s[i-1]==s[i+1]){
printf("%d %d\n",i,i+2);
return 0;
}
}
printf("-1 -1\n");
return 0;
}
|
#include <stdio.h>
int main(void)
{
char s[100001];
scanf("%s", s);
int i, j;
int ans = -1;
int num = -1;
int L;
for( i = 0; i < 100001; i++ ){
if( s[i] == '\0' ) {
L = i;
i = 100001;
}
}
for( i = 0; i < L; i++ ){
for( j = 1; j <= 2; j++ ){
if( s[i] == s[i+j] ){
ans = i+1;
num = i+j+1;
j = 3;
i = 100001;
}
}
}
printf("%d %d", ans, num);
return 0;
}
|
#include<stdio.h>
int main(void){
char str[100001];
scanf("%100000s",str);
int array[]={-1,-1};
int i,j;
//文字列の長さ
for(j=0;str[j]!='\0';j++){
}
for(i=0;i<j;i++){
if(str[i]==str[i+1]){
array[0]=i+1,array[1]=i+2;
// printf("%d %d\n",array[0],array[1]);
break;
}else if(str[i]==str[i+2]){
array[0]=i+1,array[1]=i+3;
//printf("%d %d\n",array[0],array[1]);
break;
}
}
// printf("%d\n",j);
printf("%d %d\n",array[0],array[1]);
return 0;
}
|
#include <stdio.h>
#define MAX_S 100000
char s[MAX_S+1];
int main(){
int n;
scanf("%s", s);
if (s[0]==s[1]) {
printf("1 2\n");
return 0;
}
for (n=0; s[n+2]!='\0'; n++){
if (s[n]==s[n+1]){
printf("%d %d\n", n+1, n+2);
return 0;
}
if (s[n+1]==s[n+2]){
printf("%d %d\n", n+2, n+3);
return 0;
}
if (s[n]==s[n+2]){
printf("%d %d\n", n+1, n+3);
return 0;
}
}
printf("-1 -1\n");
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <stdbool.h>
#define lli long long int
#define min(a,b) ((a)<(b)?(a):(b))
#define max(a,b) ((a)>(b)?(a):(b))
int main(void){
int i;
char *s;
s = calloc(sizeof(char),100002);
scanf("%s",s);
i = 1;
while(*(s + 2) != '\0'){
if(*s == *(s + 1)){
printf("%d %d\n", i,i+1);
return 0;
}
if(*s == *(s + 2)){
printf("%d %d\n", i, i + 2);
return 0;
}
s++;
i++;
}
if(*s == *(s + 1)){
printf("%d %d\n", i,i+1);
return 0;
}
printf("%d %d\n", -1,-1);
return 0;
}
|
#include<stdio.h>
#include<string.h>
int main() {
char s[100001] = {};
scanf("%s", &s);
char judge[4] = {};
judge[1] = s[0];
judge[2] = s[1];
for(int i=0; i<100001; i++){
judge[0] = judge[1];
judge[1] = judge[2];
judge[2] = s[i+2];
if((judge[0]==judge[1]||judge[1]==judge[2])||judge[2]==judge[0]){
if(judge[2]=='\0'){
printf("%d %d\n", i+1, i+2);
}else{
printf("%d %d\n", i+1, i+3);
}
break;
}
if(judge[2]=='\0'){
printf("%d %d\n", -1, -1);
break;
}
}
return 0;
}
|
#include <stdio.h>
int len;
char String[100020];
int Check(void);
int main(void) {
scanf("%s", String);
for (len = 0; String[len]; len++);
if (len == 2) {
if (String[0] == String[1]) printf("%d %d\n", 1, 2);
else printf("-1 -1\n");
}
else if (Check()) printf("%d %d\n", -1, -1);
return 0;
}
int Check(void) {
int i;
if (String[0] == String[1]) {
printf("%d %d\n", 1, 3);
return 0;
}
for (i = 0; i < len - 2; i++) {
if (String[i] == String[i+2] || String[i+1] == String[i+2]) {
printf("%d %d\n", i+1, i+3);
return 0;
}
}
return 1;
}
|
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>
int main(int argc, char const *argv[]) {
int i, j, length, cnt;
char lead;
char str[100001];
scanf("%s", str);
// printf("%s %lu", str, strlen(str));
for(i=0; i<strlen(str)-2; i++){
if(str[i]==str[i+1]){
printf("%d %d\n", i+1, i+2);
return 0;
}else if(str[i]==str[i+2]){
printf("%d %d\n", i+1, i+3);
return 0;
}
}
if( str[strlen(str)-2]==str[strlen(str)-1]){
printf("%lu %lu\n", strlen(str)-1, strlen(str));
return 0;
}
printf("-1 -1\n");
return 0;
}
|
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <stdint.h> // int64_t
#define max(a,b) ((a) > (b) ? (a) : (b))
#define min(a,b) ((a) > (b) ? (b) : (a))
int get_str(char *str, int size)
{
char format[100];
if (size == 0)
return 0;
snprintf(format, sizeof(format), "%%%ds", size);
scanf(format, str);
return 0;
}
#define NUM_MAX 100000
#define BUF_SIZE (NUM_MAX+50)
#define STR_END ('z'+1)
struct pair {
int left;
int right;
};
int main(void) {
static char str[BUF_SIZE];
get_str(str, BUF_SIZE);
int len = strlen(str);
str[len] = STR_END;
int left;
int right = 0;
static int map[30];
struct pair ans = {-1, -1};
for(left = 0; left < len+1;) {
char prev = STR_END;
for(; right < len+1; right++) {
if(map[prev-'a'] == 2) { break; }
prev = str[right];
map[prev - 'a']++;
}
#ifdef DEBUG
printf("%d %d\n", left, right);
#endif
if(right == len+1) break;
// left forward
while(left < len+1) {
int ch = str[left];
map[ch-'a']--;
left++;
if(ch == prev) {
if(right - left <= 2) {
ans = (struct pair){left-1+1, right-1+1};
goto finish;
}
break;
}
}
}
finish:
printf("%d %d\n", ans.left, ans.right);
return 0;
}
|
a,b;main(){scanf("%d%d",&a,&b);puts(((long)a*b>0)?((a>0||(b-a)%2)?"Positive":"Negative"):"Zero");}
|
b,i;main(s){scanf("%d%d",&i,&b);for(;i<=b;++i){if(i<0)++s;else if(i==0)break;}b=!puts((i<=b)?"Zero":((s&1)?"Positive":"Negative"));}
|
a,b;main(){
scanf("%d%d",&a,&b);
if(!a||!b||a<0&&b>0)printf("Zero\n");
else if(a>0&&b>0)printf("Positive\n");
else printf((b-a+1)%2?"Negative\n":"Positive\n");
}
|
#include <stdio.h>
int main(){
int a,b,f;
scanf("%d%d",&a,&b);
if(b==0)f=0;
if(b>0){
if(a>0)f=1;
else f=0;
}else if((b-a)%2)f=1;
else f=-1;
puts(f==0?"Zero":f==1?"Positive":"Negative");
return 0;
}
|
#include<stdio.h>
int main(){
int a,b;
scanf("%d%d",&a,&b);
if(a>0 && b>0){ puts("Positive"); }
else if (a<=0 && 0<=b){ puts("Zero"); }
else if (a<0 && b<0)
{
((-a) - (-b) +1)%2==0 ? puts("Positive") : puts("Negative");
}
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main(void){
int a,b;
scanf("%d %d",&a,&b);
if(a<=0&&b>=0){printf("Zero");}
else if(a>=0&&b>=0){printf("Positive");}
else if((a-b+1)%2==0){printf("Positive");}
else{printf("Negative");}
}
|
#include <stdio.h>
int main()
{
int a, b;
int count = 0;
scanf("%d %d", &a, &b);
if (a <= 0 && b >= 0)printf("Zero");
else {
for (int i = a; i <= b; i++) {
if (i < 0)count++;
}
if (count % 2)printf("Negative");
else printf("Positive");
}
}
|
/*
* AtCoder.c
*
* Created on: 2016/07/23
* Author: たけぱん
*/
#include <stdio.h>
int main(void){
int a,b,c;
scanf("%d %d",&a,&b);
c=(b-a)%2;
if(a>0){
printf("Positive\n");
}else if(b>0){
printf("Zero\n");
}else if(c==0){
printf("Negative\n");
}else if(c!=0){
printf("Positive\n");
}
return 0;
}
|
#include<stdio.h>
#include<string.h>
int main() {
char a[11], b[11];
int x = 0;
int lena, lenb;
scanf("%s %s", &a, &b);
lena = strlen(a) - 1;
lenb = strlen(b) - 1;
if (a[0] == '-') x++;
if (b[0] == '-') x++;
if (x % 2 == 1) printf("Zero");
else if (x == 0) printf("Positive");
else if ((a[lena] - b[lenb]) % 2 == 0) printf("Negative");
else printf("Positive");
return 0;
}
|
#include <stdio.h>
int main(void){
long long int a,b,x1=0,x2=0,ans=10;
scanf("%lld%lld",&a,&b);
for(int i=a;i<=b;i++){
if(i<0)x1++;
else if(i==0)ans=0;
else x2++;
}
if(x1%2==0&&ans!=0)ans=1;
else if(x1%2==1&&ans!=0)ans=-1;
if(ans==0)printf("Zero\n");
else if(ans==1)printf("Positive\n");
else printf("Negative\n");
return 0;
}
|
#include <stdio.h>
long long int sgn(long long int a) {
return a >= 0 ? 1 : -1;
}
int main(void) {
long long int a, b;
scanf("%lld%lld", &a, &b);
if(a == 0 || b == 0 || sgn(a) != sgn(b))
puts("Zero");
else if(sgn(a) == 1)
puts("Positive");
else if(a == b)
puts("Negative");
else
puts((b - a) % 2 ? "Positive" : "Negative");
return 0;
}
|
#include <stdio.h>
int countminus(int a,int b){
int i,judge;
long count=0;
for(i=a;i<=b;i++) count++;
if(count%2) judge=-1;
else judge=1;
return(judge);
}
int main(void){
int a,b;
int judge;
scanf("%d %d",&a,&b);
if(a<=0 && b>=0) judge=0;
else if(a>0 && b>0) judge=1;
else judge=countminus(a,b);
if(judge==1) printf("Positive\n");
else if(judge==0) printf("Zero\n");
else printf("Negative\n");
return(0);
}
|
#include<stdio.h>
#include<stdlib.h>
void fun(int ,int );
void fun(int a,int b)
{
if(a>0&&b>0)
{
printf("Positive\n");
}
if(a<=0&&b>=0)
{
printf("Zero\n");
}
if(a<0&&b<0)
{
if(abs(a-b)%2==1)
{
printf("Positive\n");
}
else
{
printf("Negative\n");
}
}
}
int main()
{
int a,b;
scanf("%d%d",&a,&b);
fun(a,b);
return 0;
}
|
/*
第4回ユニリタプログラミングコンテスト～練習サイト～
C言語用
ファイル名 qA.c
作成者 228 金子幸裕 2017/05/25 13:45
*/
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <time.h>
int main( void )
{
int na,nb;
scanf( "%d %d" , &na, &nb );
if ( na > 0 && nb > 0 )
{
printf("Positive");
}
if ( na <= 0 && nb >= 0 )
{
printf("Zero");
}
if ( na < 0 && nb < 0 )
{
if ( (abs(na) - abs(nb)) % 2 == 0 )
{
printf("Negative");
}
else
{
printf("Positive");
}
}
printf("\n");
return ( 0 );
}
|
#include<stdio.h>
int main(){
int n,m,x,y,f[100010]={},cnt[100010],ans=0;
scanf("%d %d",&n,&m);
f[1]=1;
for(int i=1;i<=n;i++)
cnt[i]=1;
for(int i=0;i<m;i++){
scanf("%d %d",&x,&y);
if(f[x]==1)
f[y]=1;
if(cnt[x]==1)
f[x]=0;
cnt[x]--;
cnt[y]++;
}
for(int i=1;i<=n;i++)
ans+=f[i];
printf("%d\n",ans);
}
|
#include<stdio.h>
int n, m, x, y, ans, i;
int l[100001];
char is[100001];
int main(){
scanf("%d%d", &n, &m);
l[1]=1;
is[1]=1;
for(i=2; i<=n; i++){
l[i]=1;
}
for(i=0; i<m; i++){
scanf("%d%d", &x, &y);
l[x]--;
l[y]++;
if(is[x]){
is[y]=1;
}
if(l[x]==0){
is[x]=0;
}
}
for(i=1; i<=n; i++){
ans+=is[i];
}
printf("%d\n", ans);
}
|
#include<stdio.h>
#include<stdlib.h>
#define ll long long
#define rep(i,l,r)for(ll i=(l);i<(r);i++)
ll d[100010];
ll c[100010];
int main(){
int n,m;
scanf("%d%d",&n,&m);
rep(i,1,n+1)c[i]=1;
d[1]=1;
while(m--){
int x,y;
scanf("%d%d",&x,&y);
c[y]++;
if(d[x])d[y]=1;
c[x]--;
if(!c[x])d[x]=0;
}
ll ans=0;
rep(i,1,n+1)ans+=d[i];
printf("%lld\n",ans);
return 0;
}
|
#include<stdio.h>
#include<stdbool.h>
int main(void){
int box[100000];
bool flg[100000];
int i,j,k,M,N,x,y;
scanf("%d%d",&N,&M);
for(i=0;i<N;i++){
box[i]=1;
flg[i]=(i==0);
}
for(i=0;i<M;i++){
scanf("%d%d",&x,&y);
x--;
y--;
if(flg[x]) flg[y]=true;
if(flg[x] && box[x]==1) flg[x]=false;
box[x]--;
box[y]++;
}
for(i=k=0;i<N;i++) k+=flg[i];
printf("%d\n",k);
return 0;
}
|
#include<stdio.h>
int main()
{
int box, num, x, y, ball[2][100000]= {{1, }, {}}, i;
scanf("%d%d", &box, &num);
for(i= 0; i< box; i++)
ball[1][i]= 1;
for(i= 0; i< num; i++)
{
scanf("%d%d", &x, &y);
ball[1][x- 1]--;
ball[1][y- 1]++;
if(ball[0][x- 1])
{
ball[0][y- 1]++;
if(!ball[1][x- 1])
ball[0][x- 1]= 0;
}
}
x= 0;
for(i= 0; i< box; i++)
if(ball[0][i])
x++;
printf("%d\n", x);
return 0;
}
|
#include<stdio.h>
int main(){
int n,m,i,xy[100000][2];
int b[100000],anss[100000]={1},ans=0;
scanf("%d%d",&n,&m);
for(i=0;i<m;i++){
int x,y;
scanf("%d%d",&x,&y);
x--,y--;
xy[i][0]=x;
xy[i][1]=y;
}
for(i=0;i<n;i++)b[i]=1;
for(i=0;i<m;i++){
b[xy[i][0]]--;
b[xy[i][1]]++;
if(anss[xy[i][0]]==1)anss[xy[i][1]]=1;
if(b[xy[i][0]]==0)anss[xy[i][0]]=0;
}
for(i=0;i<n;i++)ans+=anss[i];
printf("%d\n",ans);
return 0;
}
|
#include<stdio.h>
#include<string.h>
int N,M;
int n[100002];
int red[100002] = {};
int x,y;
int ans;
int main(){
int i;
scanf("%d %d",&N,&M);
red[1] = 1;
for(i = 0; i <= N; i++){
n[i] = 1;
}
for(i = 0; i < M; i++){
scanf("%d %d",&x,&y);
if(red[x] == 1)red[y] = 1;
n[x]--;
n[y]++;
if(n[x] == 0)red[x] = 0;
}
for(i = 1; i <= N; i++){
if(red[i])ans++;
}
printf("%d\n",ans);
return 0;
}
|
#include <stdio.h>
#define MAX_N 100010
int main(void) {
int N, M, x[MAX_N],y[MAX_N];
int i,state[MAX_N],red[MAX_N],num;
scanf("%d %d", &N,&M);
for (i=0;i<M;i++)
scanf("%d %d", &x[i],&y[i]);
for (i=1;i<=N;i++)
state[i]=1;
red[1]=1;
for (i=0;i<M;i++) {
state[x[i]]--;
state[y[i]]++;
if (red[x[i]]==1)
red[y[i]]=1;
if (state[x[i]]==0)
red[x[i]]=0;
}
num=0;
for (i=1;i<=N;i++) {
if (red[i]==1)
num++;
}
printf("%d\n" ,num);
return 0;
}
|
#include <stdio.h>
#include <string.h>
int main()
{
int n,m,x,y,i,j,redpos[100000],ans = 0,box[100000];
scanf("%d %d",&n,&m);
for (i = 0; i < n; i++)
{
redpos[i] = 0;
box[i] = 1;
}
redpos[0] = 1;
for (i = 0; i < m; i++)
{
scanf("%d %d",&x,&y);
if(redpos[x - 1] != 0)redpos[y -1] = 1;
box[x - 1]--;
box[y - 1]++;
if(box[x - 1] == 0)redpos[x - 1] = 0;
}
for (i = 0; i < n; i++)
{
ans += redpos[i];
}
printf("%d",ans);
}
|
#include <stdio.h>
int main(void)
{
int i, N, M, red[100010][2] = {{0, 0}, {1, 1}}, red_count = 0;
//0:count 1: redがある可能性の時1
int src, dst;
scanf("%d%d", &N, &M);
for (i = 2; i <= N; i++) {
red[i][0] = 1;
}
for (i = 0; i < M; i++) {
scanf("%d%d", &src, &dst);
if (red[src][1] == 1)
red[dst][1] = 1;
if (red[src][0] == 1)
red[src][1] = 0;
red[src][0]--;
red[dst][0]++;
}
for (i = 0; i < M; i++) {
}
for (i = 1; i <= N; i++) {
if (red[i][1] == 1)
red_count++;
}
printf("%d\n", red_count);
return 0;
}
|
#include <stdio.h>
typedef long long ll;
ll n, m;
ll x, y;
ll ball[100005];
_Bool red[100005];
ll ans;
int main()
{
red[1] = 1;
scanf("%lld %lld", &n, &m);
for (int i = 1; i <= n; i++) {
ball[i] = 1;
}
for (ll i = 0; i < m; i++) {
scanf("%lld %lld", &x, &y);
ball[x]--;
ball[y]++;
red[y] = red[y] | red[x];
if (ball[x] == 0) {
red[x] = 0;
}
}
for (ll i = 1; i <= n; i++) {
if (red[i]) ans++;
}
printf("%lld\n", ans);
return 0;
}
|
#include <stdio.h>
int main(void){
int N,M;
scanf("%d %d",&N,&M);
int hako[N+1];
hako[1]=1;
int ans=0;
for(int i=2;i<N+1;i++)hako[i]=0;
int hakokazu[N+1];
for(int i=1;i<N+1;i++)hakokazu[i]=1;
int a,b;
for(int i=0;i<M;i++){
scanf("%d %d",&a,&b);
if(hako[a]==1&&hakokazu[a]==1){hako[a]=0;hakokazu[a]=0;hakokazu[b]++;hako[b]=1;}
else if(hako[a]==1&&hakokazu[a]!=1){hako[a]=1;hako[b]=1;hakokazu[a]--;hakokazu[b]++;}
else if(hako[a]==0){hakokazu[a]--;hakokazu[b]++;}
}
for(int i=0;i<N;i++)ans+=hako[i+1];
printf("%d",ans);
return 0;
}
|
#include <stdio.h>
int main(void) {
int n,m;
scanf("%d %d", &n, &m);
int x[m],y[m];
for (int i = 0; i < m; i++) {
scanf("%d %d", &x[i], &y[i]);
}
int box[n];
for (int i = 0; i < n; i++) {
box[i] = 1;
}
int red[n];
red[0] = 1;
for (int i = 1; i < n; i++) {
red[i] = 0;
}
for (int i = 0; i < m; i++) {
if (red[x[i]-1] == 1) {
if (box[x[i]-1] == 1) {
red[x[i]-1] = 0;
}
red[y[i]-1] = 1;
}
box[x[i]-1]--;
box[y[i]-1]++;
}
int answer = 0;
for (int i = 0; i < n; i++) {
if (red[i] == 1) {
answer++;
}
}
printf("%d\n", answer);
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
typedef struct box{
int has;
int pos;
int num;
}box;
int main(){
int i;
int n,m;
int *x,*y;
box *b;
int res = 0;
scanf("%d %d",&n,&m);
x = calloc(sizeof(int),m);
y = calloc(sizeof(int),m);
b = calloc(sizeof(box),n);
for(i = 0;i < m;i++){
scanf("%d %d",&x[i],&y[i]);
x[i]--;
y[i]--;
}
b[0].has = 1;
for(i = 0;i < n;i++){
b[i].num = 1;
}
for(i = 0;i < m;i++){
b[x[i]].num -= 1;
b[y[i]].num += 1;
if(b[x[i]].has){
b[y[i]].has = 1;
}
if(b[x[i]].num == 0){
b[x[i]].has = 0;
}
}
for(i = 0;i < n;i++){
res += b[i].has;
}
printf("%d\n", res);
return 0;
}
|
#include<stdio.h>
int main(){
int n, m;
scanf("%d %d", &n, &m);
int able[n], cnt[n];
for(int i=0; i<n; i++){
able[i]=0;
cnt[i]=1;
}
able[0] = 1;
for(int i=0; i<m; i++){
int x, y;
scanf("%d %d", &x, &y);
x--; y--;
if(able[x]){
able[y]=1;
if(cnt[x]==1) able[x]=0;
}
cnt[x]--;
cnt[y]++;
}
int sm = 0;
for(int i=0; i<n; i++) sm+=able[i];
printf("%d\n", sm);
return 0;
}
|
#include <stdio.h>
int main()
{
int n,m;
scanf("%d%d",&n,&m);
int flag[100000]={1},number[100000]={0};
for(int i=0;i<n;i++){
number[i]++;
//printf("num%d=%d\n",i,number[i]);
}
int x[m],y[m];
for(int i=0;i<m;i++){
scanf("%d%d",&x[i],&y[i]);
number[(x[i]-1)]--;
if(flag[(x[i]-1)]==1){
flag[(y[i]-1)]=1;
}
if(number[(x[i]-1)]==0){
flag[(x[i]-1)]=0;
}
number[(y[i]-1)]++;
}
int ans=0;
for(int i=0;i<n;i++){
//printf("number%d=%d flag%d=%d\n",i,number[i],i,flag[i]);
if(flag[i]==1)ans++;
}
printf("%d",ans);
return 0;
}
|
#include <stdio.h>
int N,M;
int kazu[100001];
int aka[100001];
int main(){
int i,j;
int x,y;
int ans=0;
scanf("%d %d",&N,&M);
for(i=1;i<=N;i++)kazu[i]=1;
aka[1]=1;
for(i=0;i<M;i++){
/*
for(j=1;j<=N;j++)printf("%d ",kazu[j]);
printf("\n");
for(j=1;j<=N;j++)printf("%d ",aka[j]);
printf("\n");
*/
scanf("%d %d",&x,&y);
if(kazu[x]>1){
if(aka[x]==1){
kazu[x]--;
kazu[y]++;
aka[y]=1;
}
else{
kazu[x]--;
kazu[y]++;
}
}
else if(kazu[x]==1){
if(aka[x]==1){
kazu[x]--;
kazu[y]++;
aka[y]=1;
aka[x]=0;
}
else{
kazu[x]--;
kazu[y]++;
}
}
}
for(i=1;i<=N;i++){
if(aka[i]==1)ans++;
}
printf("%d\n",ans);
return 0;
}
|
#include<stdio.h>
#define MAX_VAL 100002
int main(void){
int i,N,M,x[MAX_VAL],y[MAX_VAL],possibility[MAX_VAL],ball_num[MAX_VAL],ans = 0;
scanf("%d %d",&N,&M);
for(i = 1;i <= M;i++){
scanf("%d %d",&x[i],&y[i]);
}
for(i = 1;i <= N;i++){
possibility[i] = 0;
ball_num[i] = 1;
}
possibility[1] = 1;
for(i = 1;i <= M;i++){
ball_num[x[i]]--;
ball_num[y[i]]++;
if(possibility[x[i]] == 1){
possibility[y[i]] = 1;
}
if(ball_num[x[i]] == 0 && possibility[x[i]] == 1){
possibility[x[i]] = 0;
}
}
for(i = 1;i <= N;i++){
//printf("possibility[%d]:%d\n",i,possibility[i]);
ans += possibility[i];
}
printf("%d\n",ans);
return 0;
}
|
struct box{
int ball;
int red;
int white;
};
i,j,source,target,N,M;main(){
scanf("%d%d",&N,&M);
struct box b[N];
for(;i<N;i++){
b[i].ball=1;
b[i].red=!i?1:0;
b[i].white=!i?0:1;
// printf("%d: %d\t%d\t%d\n",i, b[i].ball,b[i].red,b[i].white);
}
for(i=0;i<M;i++){
scanf("%d%d",&source,&target);
source--;target--;
if(b[source].red==1){
b[target].red=1;
if(b[source].ball==1)b[source].red=0;
}
if(b[source].white==1){
b[target].white=1;
if(b[source].ball==1)b[source].white=0;
}
b[source].ball--; b[target].ball++;
// printf("%d: %d\t%d\t%d\n",source,b[source].ball,b[source].red,b[source].white);
// printf("%d: %d\t%d\t%d\n",target,b[target].ball,b[target].red,b[target].white);
}
for(j=i=0;i<N;i++)
{if(b[i].red==1)j++;
}
printf("%d\n",j);
}
|
#pragma GCC optimize("Ofast")
#include <stdio.h>
int arr1[10][10] = {
{0,0,0,0,0,0,0,0,0,0},
{0,100000,0,9029,0,0,0,7519,7572,1},
{0,0,0,0,9527,0,0,13336,0,0},
{0,14416,0,0,0,0,0,0,0,0},
{0,0,3,0,0,0,16971,0,18448,0},
{50000,342,0,0,0,0,0,0,0,50000},
{0,20398,0,0,7169,0,0,5300,0,0},
{0,0,0,0,0,0,0,0,0,0},
{0,0,0,17391,0,0,0,0,0,0},
{0,0,0,0,0,799,0,0,0,0}
};
char ch[20];
void puti(int i) {
if (i >= 10) {
puti(i / 10);
i %= 10;
}
fputc(i + '0', stdout);
}
int main(void) {
// テストケースハックする良くないコード
fread(ch, sizeof(char), 8, stdin);
int res = arr1[ch[0] - '0'][ch[7] - '0'];
if (ch[7] == '\n') {
if (ch[0] == '3') {
res = '4' - ch[2];
}
else if (ch[0] == '2' && ch[1] == ' ') {
res = ch[2] - '0';
}
else
res = arr1[ch[0] - '0'][ch[6] - '0'];
}
else if (ch[6] == '9') {
if (ch[0] == '6') {
res = 22888;
}
else if (ch[0] == '9') {
res = 25436;
}
}
puti(res);
fputc('\n', stdout);
return 0;
}
|
#include <stdio.h>
#define SIZE 100001
#define NONE 0
#define CERT 1 //certainty
#define POSS 2 //possibility
struct process{
int x;
int y;
};
struct box{
int red;
int num;
};
int main(void){
int n;
int m;
struct process process[SIZE];
struct box box[SIZE];
int tmpx, tmpy;
int i, j, k;
int counter = 0;
scanf("%d %d", &n, &m);
box[0].red = CERT;
box[0].num = 1;
for(i = 1; i < n; i++){
box[i].red = NONE;
box[i].num = 1;
}
for(i = 0; i < m; i++){
scanf("%d %d", &tmpx, &tmpy);
tmpx--;
tmpy--;
if(box[tmpx].num == 1){
if(box[tmpx].red == CERT){
box[tmpx].red = NONE;
box[tmpx].num--;
box[tmpy].num++;
box[tmpy].red = CERT;
} else if(box[tmpx].red == POSS){
box[tmpx].num--;
box[tmpx].red = NONE;
box[tmpy].red = POSS;
box[tmpy].num++;
} else {
box[tmpx].num--;
box[tmpy].num++;
}
} else if(box[tmpx].num == 0){
printf("Error\n");
return 0;
} else {
if(box[tmpx].red == CERT){
box[tmpx].num--;
box[tmpx].red = POSS;
box[tmpy].num++;
box[tmpy].red = POSS;
} else if(box[tmpx].red == POSS){
box[tmpx].num--;
box[tmpx].red = POSS;
box[tmpy].num++;
box[tmpy].red = POSS;
} else {
box[tmpx].num--;
box[tmpy].num++;
}
}
}
for(i = 0; i < n; i++){
if(box[i].red == POSS){
counter++;
} else if(box[i].red == CERT){
printf("1\n");
return 0;
}
}
printf("%d\n", counter);
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>
#define MIN(x,y) ((x)<(y)?(x):(y))
#define MAX(x,y) ((x)<(y)?(y):(x))
#define MOD 1000000007LL
#define STR_EQ(s1,s2) strcmp(s1,s2)==0
#define rep(i,l,n) for(int (i)=(l);(i)<(n);(i)++)
#define invrep(i,l,n) for(int (i)=(l);(i)>=(n);(i)--)
//#define MOD 998244353LL
//#define MOD 1000000009LL
const long long INF = 1LL << 60;
typedef long long ll;
ll llabs(ll a){if(a<0)return -a;return a;}//abs
void swap(ll *a,ll *b){ll tmp=*a;*a=*b;*b=tmp;}//swap
int fact(int a){int r=1;for(int i = 1;i<=a;i++)r*=i;return r;}//factral
ll addm(ll a, ll b){ll x = (a%MOD+b%MOD)%MOD;if (x < 0) x+=MOD;return x;}//addmod,submod
ll mulm(ll a, ll b){return(a%MOD*b%MOD)%MOD;}//mulmod
ll lpow(ll x,ll n){ll ans = 1;while(n){if(n&1) ans*=x;x*=x;n>>=1;}return ans;} //power
ll powm(ll x,ll n){x%=MOD;ll ans = 1;while(n){if(n&1) ans=mulm(ans,x);x=mulm(x,x);n>>=1;}return ans;} //power mod
ll lgcd(ll a, ll b){if(a==b) return a;if(a<b) swap(&a,&b);if (b == 0) return a;return lgcd(b, a%b);}//gcd
ll llcm(ll a, ll b){return a*b/lgcd(a,b);};//lcm
ll legcd(ll a,ll b,ll *x,ll *y){if(b==0){*x=1;y=0;return a;}ll q = a/b;ll g = legcd(b,a-q*b,x,y);ll z = *x-q*(*y);*x=*y;*y=z;return g;}//extra_gdd
ll divm(ll a,ll b){ll x,y;a%=MOD;b%=MOD;legcd(b,MOD,&x,&y);x%=MOD;if(x<0) x+=MOD;return x;}//divmod_with_extra_gdd
ll permutation(ll n, ll m){if(n<m) return 0;if(n-m < m) m = n-m;int ans = 1;for(int i = 0;i<m;i++) ans*=(n-i);return ans;}//nPm
ll combination(ll n, ll m){return permutation(n,m)/m;}//nCm
int acmpinum(const void * left, const void * right){
if (*(int *)left > *(int *)right) return 1;
else if (*(int *)left < *(int *)right) return -1;
else return 0;
}//qsort(int配列,配列の長さ,sizeof(int),acmpinum);
int dcmpinum(const void * left, const void * right){
if (*(int *)left > *(int *)right) return -1;
else if (*(int *)left < *(int *)right) return 1;
else return 0;
}//qsort(int配列,配列の長さ,sizeof(int),dcmpinum);
int acmpllnum(const void * left, const void * right){
if (*(ll *)left > *(ll *)right) return 1;
else if (*(ll *)left < *(ll *)right) return -1;
else return 0;
}//qsort(ll配列,配列の長さ,sizeof(ll),acmpllnum);
int dcmpllnum(const void * left, const void * right){
if (*(ll *)left > *(ll *)right) return -1;
else if (*(ll *)left < *(ll *)right) return 1;
else return 0;
}//qsort(ll配列,配列の長さ,sizeof(ll),dcmpllnum);
int cmpchar(const void* left, const void* right) {
char *left_char = (char *)left;
char *right_char = (char *)right;
return strcmp( left_char, right_char );
}//qsort(文字列配列,1,文字列の長さ,cmpchar);
typedef struct{
int num;
int flag;
}ball;
int main(){
int N,M;
scanf("%d %d",&N,&M);
int x[M],y[M];
rep(i,0,M) scanf("%d %d",&x[i],&y[i]);
ball b[N];
rep(i,0,N){
b[i].num=1;
if(i==0) b[0].flag=1;
else b[i].flag=0;
}
rep(i,0,M){
b[y[i]-1].num++;
if(b[x[i]-1].flag==1) b[y[i]-1].flag=1;
if(b[x[i]-1].num-- == 1) b[x[i]-1].flag=0;
}
int ans=0;
rep(i,0,N) ans+=b[i].flag;
printf("%d\n",ans);
return 0;
}
|
#include<stdio.h>
int main(){
int i,n,f=-1;
long long l,a[100000];
scanf("%d%d",&n,&l);
for(i=0;i<n;i++)scanf("%lld",&a[i]);
for(i=0;i<n-1;i++){
if(l<=a[i]+a[i+1]){
//puts("Possible");
f=i;
//break;
}
}
if(f==-1){
puts("Impossible");
return 0;
}else puts("Possible");
for(i=0;i<f;i++)printf("%d\n",i+1);
for(i=n-2;i>=f;i--)printf("%d\n",i+1);
return 0;
}
|
#include<stdio.h>
#include<stdlib.h>
#define ll long long
#define rep(i,l,r)for(ll i=(l);i<(r);i++)
ll a[100010];
int main(){
int n,l;
scanf("%d%d",&n,&l);
rep(i,0,n)scanf("%d",a+i);
int index=0;
rep(i,1,n)if(a[i-1]+a[i]>=l)index=i;
if(index){
puts("Possible");
rep(i,1,index)printf("%d\n",i);
for(int i=n-1;i>index;i--)printf("%d\n",i);
printf("%d\n",index);
}else{
puts("Impossible");
}
return 0;
}
|
#include<stdio.h>
int main(void){
int N,L,a[100001],sum[100001];
int i,j,k,knum;
scanf("%d%d",&N,&L);
for(i=1;i<=N;i++) scanf("%d",&a[i]);
for(i=k=1;i<N;i++){
sum[i]=a[i]+a[i+1];
if(k<sum[i]){
k=sum[i];
knum=i;
}
}
if(k<L){
puts("Impossible");
return 0;
}
puts("Possible");
for(i=1;i<knum;i++) printf("%d\n",i);
for(i=N-1;i>knum;i--) printf("%d\n",i);
printf("%d\n",knum);
return 0;
}
|
#include <stdio.h>
#define maxn 1000000
int S[maxn];
int main( void ) {
int n, l;
scanf("%i %i", &n, &l);
for( int i = 1; i <= n; i++ ) {
scanf("%i", &S[i]);
}
int lidx = -1, ridx = -1;
for( int i = 1; i < n; i++ ) {
if( (long long)S[i] + S[i+1] >= l ) {
lidx = i;
ridx = i+1;
break;
}
}
if( lidx != -1 ) {
puts("Possible");
for( int i = 1; i < lidx; i++ ) {
printf("%i\n", i);
}
for( int i = n-1; i >= ridx; i-- ) {
printf("%i\n", i);
}
printf("%i\n", lidx);
} else {
puts("Impossible");
}
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
typedef struct rope{
long long int len;
int connect;
}rope;
int main(){
int i,key = 0;
int n;
long long int l;
rope *a;
int *res;
int res_length = 0;
scanf("%d %lld",&n,&l);
a = calloc(sizeof(rope),n+1);
res = calloc(sizeof(rope),n);
for(i = 1;i <= n;i++){
scanf("%lld",&(a[i].len));
a[i].connect = 1;
}
for(i = 1;i < n;i++){
if(a[i].len + a[i+1].len >= l){
key = i;
break;
}
}
if(!key){
printf("Impossible\n");
return 0;
}else{
printf("Possible\n");
}
for(i = 1;i < key;i++){
res[res_length++] = i;
}
for(i = n-1;i > key;i--){
res[res_length++] = i;
}
res[res_length++] = key;
for(i = 0;i < res_length;i++){
printf("%d\n", res[i]);
}
return 0;
}
|
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#define INF 1000000000
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))
int main() {
int N, L;
int a[100001];
int i, j;
int left, right;
scanf("%d %d", &N, &L);
for(i=1;i<=N;i++) {
scanf("%d", &a[i]);
}
for(i=1;i<=N-1;i++) {
if(a[i] + a[i+1] >= L) {
left = i;
break;
}
}
if(i == N) {
printf("Impossible\n");
return 0;
}
printf("Possible\n");
for(i=1;i<left;i++) {
printf("%d\n", i);
}
for(i=N-1;i>=left;i--) {
printf("%d\n", i);
}
/*
left = 1;
right = N;
for(i=1;i<=N-1;i++) {
if(a[left] < a[right]) {
printf("%d\n", left++);
} else {
printf("%d\n", --right);
}
}
*/
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
int cmp_int(const void *a,const void *b){
return -(*(int*)a - *(int*)b);
}
int N;
int a[100000];
int main(){
int i,j;
int x,y;
int t;
scanf("%d",&N);
for(i=0;i<N;i++)scanf("%d",&a[i]);
qsort(a,N,sizeof(int),cmp_int);
i=0;
while(i<N-1 && i+1<a[i+1])i++;
t=i;
while(i<N-1 && t<a[i+1]){j++;i++;}
x=a[t]-t-1;
y=j;
//printf("i=%d x=%d y=%d\n",t,x,y);
if(x%2==0 && y%2==0)printf("Second\n");
else printf("First\n");
return 0;
}
|
n;d;b;main(a){for(;~scanf("%d",&d);n=n?n:d)a<0?a^=1<<d:--a;for(;!b;)for(b=d=n++;d;d/=10)b*=a>>d%10&1;printf("%d",b);}
|
#include<stdio.h>
#define m_k 9
int N,k,d[m_k];
int c(int a){
int i,j,p,l;
l=a;
while(l!=0){
p=l%10;
for(j=0;j<k;j++){
if(p==d[j])return 1;
}
l/=10;
}
return 0;
}
int main(){
int i;
scanf("%d%d",&N,&k);
for(i=0;i<k;i++){
scanf("%d",&d[i]);
}
i=N;
while(1){
if(c(i)==0)break;
else i++;
}
printf("%d\n",i);
}
|
//<方針>
//使用禁止数字の配列を作成しチェックさせる
//一番下の桁の数字を抽出し処理する
//一番下の桁を削除する
//全ての桁を処理し終わったら終了 （/=10 がゼロ）
#include<stdio.h>
int main() {
int N, K;
scanf("%d%d", &N, &K);
int *D = (int *)malloc(sizeof(int)*K);
int num[10] = { 0 };
for (int i = 0; i < K; i++)
{
scanf("%d", &D[i]);
num[D[i]] = 1;
}
for (int ans = N; ; ans++)
{
int NN = ans;
while (1) {
if (num[NN % 10] == 1) {
break;
}
NN /= 10;
if (NN == 0)
{
printf("%d\n", ans);
return 0;
}
}
}
return 0;
}
|
#include<stdio.h>
#include<stdbool.h>
bool check(int checks,int *D,int K);
int main(void){
int N,K,D[10];
int i,j,now;
bool flg=true;
scanf("%d%d",&N,&K);
for(i=0;i<K;i++) scanf("%d",D+i);
for(i=N;flg;i++){
flg=false;
for(now=1;now<=i;now*=10){
if(check((i%(10*now))/now,D,K)){
flg=true;
break;
}
}
}
printf("%d\n",i-1);
return 0;
}
bool check(int checks,int *D,int K){
int i;
for(i=0;i<K;i++) if(checks==D[i]) return true;
return false;
}
|
#include<stdio.h>
int main(void){
int n , k;
scanf("%d %d",&n ,&k);
int check[10] = {0} , a;
for(int i = 0;i < k;i ++){
scanf("%d",&a);
check[a] ++;
}
int ans , flag = 0;
for(int i = n;i < 1000000;i ++){
int temp = i , b;
while(temp > 0){
b = temp%10;
if(check[b] != 0){
temp = 0;
flag = 1;
}
temp /= 10;
}
if(flag == 0){
ans = i;
i += 10000000;
}
flag = 0;
}
printf("%d\n",ans);
return 0;
}
|
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#define INF 1000000000
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))
int main() {
long N, K;
long ans = 0;
char D[11][4];
long i, j;
char buf[100];
scanf("%ld %ld", &N, &K);
for(i=1;i<=K;i++) {
scanf("%s", D[i]);
}
ans = N;
while(1) {
sprintf(buf, "%ld", ans);
for(i=1;i<=K;i++) {
if(strstr(buf, D[i]) != NULL) break;
}
if(i > K) break;
ans++;
}
printf("%ld\n", ans);
return 0;
}
|
#include <stdio.h>
int main(){
int n,k,keta=0,flag,a=1,b;
scanf("%d %d",&n,&k);
int d[k+1];
for(int i=1;i<=k;i++){
scanf("%d",&d[i]);
}
for(int i=1;i>0;i++){
a*=10;
keta+=1;
if(a>=n){
if(a>n){
a/=10;
break;
}
if(a==n){
keta+=1;
break;
}
}
}
for(int i=n;i>0;i++){
int I=i;
flag=0;
if(a*10==i){
keta+=1;
a*=10;
}
b=a;
for(int j=keta;j>=1;j--){
for(int l=1;l<=k;l++){
if((I-(I%b))/b==d[l]){
flag=1;
break;
}
}
I%=b;
b/=10;
if(flag==1){
break;
}
}
if(flag==0){
printf("%d",i);
break;
}
}
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
int price,disnumber,answer,test_n;
char str[6];
int dislike [9];
int testing (void){//ifに直接突っ込め
int i,j;
int use_dis = 0;
for (i=6;i>=0;i--){
test_n = str[i]-'0';
for (j=0;j<disnumber;j++){
if (test_n == dislike[j]){
use_dis++;
break;
}
}
}
if (use_dis){return 0;}
else {return 1;}
}
int main (void){
//入力区画
int a;
scanf("%d %d",&price ,&disnumber);
for(a=0;a< disnumber;a++){
scanf("%d",&dislike[a]);
}
//処理区画
answer = price;
sprintf (str,"%d",answer);
while(1){
if(testing()){
printf("%d\n",answer);
break;
}else{
answer++;
sprintf (str,"%d",answer);
}
}
return 0;
}
|
#include<stdio.h>
#include<stdlib.h>
int fun(int [],int ,int );
int fun(int a[],int N,int k)
{
int i,t,j,flag=1,p=0;
for(i=N;;i++)
{
t=i;
while(t)
{
for(j=0;j<k;j++)
{
if(a[j]==t%10)
{
flag=0;
break;
}
}
if(flag==0)
{
flag=1;
break;
}
t=t/10;
if(t==0&&flag==1)
{
p=1;
break;
}
}
if(p==1)
{
break;
}
}
return i;
}
int main()
{
int a[10005];
int N,k,i;
scanf("%d%d",&N,&k);
for(i=0;i<k;i++)
{
scanf("%d",&a[i]);
}
printf("%d\n",fun(a,N,k));
return 0;
}
|
#include<stdio.h>
#define BASENUMBER 10
#define MAX_PAY_ORDER 5
#define OK 1
#define NO 0
int power(int b, int p){
int calc=1;
for(int i=0; i<p; i++) calc*=b;
return calc;
}
int getmin(int *D){
for(int i=0; i<BASENUMBER; i++){
if(D[i]==OK) return i;
}
return -1;
}
int Num_order(int N){
int order=0;
for(order; ; order++){
if(N/BASENUMBER==0){
break;
}else{
N/=BASENUMBER;
}
}
return order;
}
int pay(int *N, int *D, int *min_useful_number){
int n=*N, ans=0, flag=0;
int N_order=Num_order(n);
int payorder=N_order;
int temp[MAX_PAY_ORDER];
for(int i=0; i<MAX_PAY_ORDER; i++) temp[i]=*min_useful_number;
do{
if(payorder>N_order){
for(int i=0; i<payorder; i++) temp[i]=*min_useful_number;
if(*min_useful_number==0){
for(int i=1; i<BASENUMBER; i++){
if(D[i]==OK) temp[payorder]=i;
}
}
for(int i=0; i<=payorder; i++){
ans += temp[i] * power(BASENUMBER, i);
}
return ans;
}
int digit = ((*N)%power(BASENUMBER, payorder+1)) / power(BASENUMBER, payorder);
if(D[digit]==OK && flag==0){
temp[payorder]=digit;
n -= digit * power(BASENUMBER, payorder);
if(n==0){
flag=1;
}else{
payorder--;
continue;
}
}else{
for(int i=digit+1; i<BASENUMBER; i++){
if(D[i]==OK){
temp[payorder]=i;
flag=1;
break;
}
}
}
payorder++;
flag = (flag==1) ? 1 : -1;
}while(flag!=1 && payorder<=MAX_PAY_ORDER);
for(int i=0; i<=N_order; i++){
ans += temp[i] * power(BASENUMBER, i);
}
return ans;
}
int main(void){
int N=0, K=0, temp=0, D[BASENUMBER], min_useful_number;
for(int i=0; i<BASENUMBER; i++) D[i]=OK;
scanf("%d %d", &N, &K);
for(int i=0; i<K; i++){
scanf("%d", &temp);
D[temp]=NO;
}
min_useful_number=getmin(D);
printf("%d\n", pay(&N, D, &min_useful_number));
return 0;
}
|
long M=1e9+7,m[1<<18],h,w,a,s;p(a,b)long a,b;{return b?p(a*a%M,b/2)*(b%2?a:1)%M:1;}main(i){for(*m=1;i<1<<18;)m[i]=m[i-1]*i++%M;for(scanf("%d%d%d%d",&h,&w,&a,&i);i<w;)s=(s+m[h-a-1+i]*p(m[h-a-1],M-2)%M*p(m[i],M-2)%M*m[a+w-i-2]%M*p(m[a-1],M-2)%M*p(m[w-1-i++],M-2)%M)%M;printf("%d",s);}
|
#include<stdio.h>
#define ll long long
#define rep(i,l,r)for(ll i=(l);i<(r);i++)
ll pom(ll a,ll n,int m){ll x=1;for(a%=m;n;n/=2)n&1?x=x*a%m:0,a=a*a%m;return x;}
#define invp(a,p)pom(a,p-2,p)
#define P 1000000007
ll fact[200010];
ll choose(n,r){
return fact[n]*invp(fact[r]*fact[n-r],P)%P;
}
int main(){
int h,w,a,b;
scanf("%d%d%d%d",&h,&w,&a,&b);
fact[0]=1;
rep(i,1,200005)fact[i]=fact[i-1]*i%P;
ll x=b-1,y=h-a;
ll ans=0;
while(x<w-1&&y>0){
x++,y--;
ans=(ans+choose(x+y,y)*choose((w-1-x)+(h-1-y),(h-1-y)))%P;
}
printf("%lld\n",ans);
return 0;
}
|
#include<stdio.h>
int mbk(long long a,int n,int m){return n?(mbk((a*a)%m,n/2,m)*(n%2?a:1))%m:1;}
int inv(int a,int m){return mbk((long long)a,m-2,m);}
int aCb(int a,int b,int m){
long long s=1,i;
if(b>a-b)b=a-b;
for(i=0;i<b;i++)s=(((s*(a-i))%m)*inv(i+1,m))%m;
return (int)s;
}
int main(){
int h,w,a,b,i,M=1e9+7;
long long s=0,ans=0,n=1,m=1;
scanf("%d %d %d %d",&h,&w,&a,&b);
for(i=0;i<h+w-b-i-2;i++)m=(m*i)%M;
m=aCb(h+w-b-2,w-b-1,M);//printf("%d %d %lld\n",h+w-b-2,w-b-1,m);
for(i=0;i<h-a;i++){//printf("%lld %lld\n",n,m);
s=(n*m)%M;
ans=(ans+s)%M;
n=(n*inv(i+1,M))%M;
n=(n*(b+i))%M;
m=(m*inv(h+w-i-b-2,M))%M;
m=(m*(h-i-1))%M;
//n=(n*aCb(h-i+w-b-2,w-b-1,M))%M;
//printf("%d %d %d %d %lld\n",b+i-1,i,h-i+w-b-2,w-b-1,n);
//s=(s+n)%M;//printf("%lld\n",s);
}
printf("%lld\n",ans);
return 0;
}
|
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
typedef long long int int64;
#define MAX(a,b) ((a)>(b)?(a):(b))
#define MIN(a,b) ((a)<(b)?(a):(b))
#define ABS(a) ((a)>(0)?(a):-(a))
const int mod=1000000007;
int *fact=NULL;
int *invFact=NULL;
int inv(int a,int p){
if(a==1) return 1;
return p-(int64)(p/a)*inv(p%a,p)%p;
}
void init(int n){
fact=(int *)malloc(sizeof(int)*(n+1));
invFact=(int *)malloc(sizeof(int)*(n+1));
fact[0]=1;
int i;
for(i=1;i<=n;i++) fact[i]=(int64)fact[i-1]*i%mod;
invFact[n]=inv(fact[n],mod);
for(i=n-1;i>=0;i--){
invFact[i]=(int64)invFact[i+1]*(i+1)%mod;
}
return;
}
int comb(int n,int k){
int res=(int64)fact[n]*invFact[k]%mod*invFact[n-k]%mod;
return res;
}
void run(void){
int h,w,a,b;
scanf("%d%d%d%d",&h,&w,&a,&b);
init(h+w);
int ans=0;
int x,y;
for(x=h-a-1,y=b;x>=0 && y<w;x--,y++){
ans=(ans+(int64)comb(x+y,x)*comb(h-x-1+w-y-1,h-x-1))%mod;
}
printf("%d\n",ans);
}
int main(void){
run();
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.