content stringlengths 19 11k |
|---|
#include<stdio.h>
#define sf(a) scanf("%d", &a)
int main(){
int N, d, i;
sf(N);sf(d);
int a[N];
for(i=0; i<N; i++){
sf(a[i]);
}
int result = 2;
for(i=0; i<N-1; i++){
if(a[i+1]-a[i] > 2*d) result += 2;
if(a[i+1]-a[i] == 2*d) result += 1;
}
pri... |
#include<stdio.h>
main()
{ long int n,R=2,d;
int i,T[100];
scanf("%ld %ld",&n,&d);
for(i=0;i<n;i++)
scanf("%d",&T[i]);
// printf("%d\t",R);
for(i=0;i<n-1;i++)
{//printf("%d\t",T[i]);
if(T[i]+d<T[i+1]-d)
{
R=R+2;
} else if(T[i]+d==T[i+1]-d)
{
R=R+1;
// printf("%d\t",i);
}
/*else if(i... |
#include <stdio.h>
int main()
{
int n,d,a[100],i,j,x,sum=2;
scanf("%d %d",&n,&d);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
if(d>=(a[i-1]-a[0]))
sum=2;
else{
for(j=0;j<n-1;j++)
{
if(a[j+1]-a[j]>d)
{
x=a[j]+d;
if(a[j+1]-x>d)
sum+=2;
else if(a[j+1]-x==d)
sum++;
... |
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
int main(){
int n,d,*arr;
scanf("%d%d",&n,&d);
arr=malloc(n*sizeof(int));
int ans=2*n;
for(int i=0;i<n;i++){
scanf("%d",arr+i);
}
for(int i=1;i<n;i++){
if(fabs(arr[i]-arr[i-1])==2*d){ans--;}
else if(fabs(arr[i]-arr... |
#include<stdio.h>
int main(){
int n,d,i,c,b,count=0,j;
scanf("%d%d",&n,&d);
int a[n];
for(i=0;i<n;i++){
scanf("%d",&a[i]);
if(i>=1){
b=a[i];
c=a[i-1];
if((c+d)==(b-d)){
count = count +1;
}
else if((c+d)<(b-d)){
count = count +2;
}
... |
#include<stdio.h>
main()
{
long long t,i,f,k,l,h[999];
scanf("%lld%lld",&t,&f);
k=2;
for(i=0;i<t;i++)
{
scanf("%lld",&h[i]);
}
for(i=0;i<t-1;i++)
{
l=h[i+1]-h[i];
if(l>(2*f)){
k+=2;
}
else if(l==(2*f)){
k++;
}
}
... |
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#define MAX 111
int n,m,x,y,a,b,d,arr[MAX],ans,tmp,i;
int main(){
for(scanf("%i%i",&n,&d);i<n;i++){
scanf("%i", &arr[i]);
}
ans=2;
for(i=0;i<n-1;i++)
{
if(abs(arr[i]-arr[i+1])-2*d==0) ans++;
else if(abs(arr[... |
#include<stdio.h>
#include<math.h>
int main()
{int n,d,i,m;
scanf("%d%d",&n,&d);
int a[n],s=2;
float div;
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
//if((a[0]+d)<a[1])
//s++;
for(i=0;i<n-1;i++){
//if((a[i]+d)<a[i+1])
//s++;
//if((a[0]-d)>a[i-1])
//s++;
div=(a[i+1]-a[i])/(d*1.000);
if(div<2)
m=1;
else ... |
#include<stdio.h>
int main()
{
int n,i;
long long int d;
scanf("%d %lld",&n,&d);
long long int a[n];
for(i=1;i<=n;i++)
{
scanf("%lld",&a[i]);
}
long long int f,b;
int count=2;
for(i=1;i<=n;i++)
{ if(i==n){break;}
f = a[i]+d;
b= a[i+1] - d;
if(f<b)
{ //printf("%d %d ",f,b);
count=count+2;
}
e... |
#include<stdio.h>
#include<string.h>
int main(){
int N, d;
int H[101];
scanf("%d %d",&N,&d);
int sum=1;
int ind=0;
for(int i=0; i<N; i++){
scanf("%d",&H[i]);
}
ind=H[0]-d;
for(int i=0; i<N; i++){
if(ind>H[i]-d){
ind=H[i]+d;
}
else if(ind == H[i]-d&&i>0){
sum+=1;
ind = H[i]+d;... |
#include <stdlib.h>
#include <stdio.h>
#include <limits.h>
int main(void)
{
int n, d;
int min = -1000000000, max = 1000000000;
int ans = 0;
scanf("%d%d", &n, &d);
int i;
int a, b;
scanf("%d", &a);
n--;
ans++;
for (i = 0; i < n; i++)
{
scanf("%d", &b);
if (((b - a) / d) >= 2)
ans = (((b-a) % d) || ((b-... |
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
int main()
{
int n,d;
scanf("%d%d",&n,&d);
int count=2;
int a[n];
for(int i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(int i=0;i<n-1;i++)
{
int sum=a[i+1]-a[i]-1;
sum=sum-(2*(d-1));
if(sum>0 && sum>=2) count=2+coun... |
#include<stdio.h>
int main()
{
int n,i;
long d,x[100],a[100],j=1,dem=2;
do{scanf("%d %ld",&n,&d);}while(n<1||n>100||d<1||d>1000000000);
for(i=1;i<=n;i++)
{
do{scanf("%ld",&x[i]);}while(x[i]<-1000000000||x[i]>1000000000);
}
for(i=1;i<=n-1;i++)
{
a[j]=x[i+1]-x[i];
j++;
}
for(j=1;j<=n-1;j++)... |
#include<stdio.h>
int main()
{
int n, c = 2;
long long int i, x, y, a[101], d;
scanf("%d %lli", &n, &d);
for(i=0; i<n; i++)
{
scanf("%lli", &a[i]);
if(i>0)
{
x = a[i-1]+d;
y= a[i]-d;
if(x<y)
c = c+2;
... |
#include <stdio.h>
#include<math.h>
#include<string.h>
#include<stdlib.h>
int main()
{
long d,n;
while(scanf("%ld%ld",&n,&d)!=EOF)
{
long a[n],i,num=0;
for(i=0;i<n;i++)
{
scanf("%ld",&a[i]);
}
for(i=1;i<n;i++)
{
if(a[i]-d>a[i-1]... |
#include <stdio.h>
#include <stdlib.h>
#define MaxNum 100
int main()
{
int n,d,Hotels[MaxNum],Count=2,i;
scanf("%d %d",&n,&d);
for(i=0;i<n;i++){
scanf("%d",&Hotels[i]);
}
for(i=1;i<n;i++){
if(Hotels[i]-Hotels[i-1]==(2*d)){
Count++;
}
else i... |
#include<stdio.h>
int main ()
{
int n, d, Array[100], i, j=0, Result;
double Half;
scanf("%d%d", &n, &d);
for(i=0; i<n; i++)
scanf("%d", &Array[i]);
for(i=1, Result=0; i<=n-1; i++, j++)
{
Half=(double)(Array[j]+Array[j+1])/2;
if(Half-(double)Array[j]==d)
... |
//
// Created by Rohit on 4/1/2020.
//
#include <stdio.h>
#include <math.h>
main(){
int n;
long long int d,i,first,second,count=2;
scanf("%d %lld",&n,&d);
scanf("%lld",&first);
d+=d;
for(i=1;i<n;i++){
scanf("%lld",&second);
if((second-first)== d)
count... |
#include <stdio.h>
main(){
int i, n, dis, count= 0;
scanf("%i%i", &n, &dis);
int city_dis[n];
for(i=0; i<n; ++i){
scanf("%i", &city_dis[i]);
}
for(i=0; i<n-1; ++i){
if((city_dis[i+1]-city_dis[i])>2*dis){
count+= 2;
}
else if((city_dis[i+1... |
#include<stdio.h>
int main() {
int n; int d,m,c,count;
scanf("%d %d", &n, &d);
int x[n];
for(count=0;count<=n-1;count=count+1)
{
scanf("%d",&x[count]);
}
m=0;
for(c=2;m<=n-2;m=m+1)
{
if(x[m+1]-(x[m]+d)>d) {
c=c+2;
... |
#include<stdio.h>
#include<math.h>
long long int n,d,a[1000],vm;long long int pan,sum;
int main(){
while(scanf("%lld%lld",&n,&d)!=EOF){
for(int i=0;i<n;i++){
scanf("%lld",&a[i]);
}
sum=pan=0;
if(d==0)sum=0;
else{
for(int i=0;i<n;i++){
pan=2;
for(int i1=i+1;i1<n;i1++){
if(i1!=i){
if(... |
#include <stdio.h>
int main(int argc, const char * argv[]) {
long long int n,d,x,y,count=2;
scanf("%lld %lld",&n,&d);
long long int location[n];
for (long long int i=0; i<n; i++) {
scanf("%lld",&location[i]);
}
for (long long int i=0; i<n-1; i++) {
x=location[i]+d;
... |
#include<stdio.h>
int main()
{
int n,m,i,sum,j,ch[200];
while(scanf("%d%d",&n,&m)!=EOF)
{
sum=0;j=0;i=0;
for(i=0;n>i;i++) //循环读取数值
{
scanf("%d",&ch[i]);
j++;
}
for(i=0;(n-1)>i;i++)
{
if(m<=(ch[i+1]-(ch[i]+m)))
... |
#include <stdio.h>
static int n;
static int d;
static int A[100];
int main(void)
{
int i;
scanf("%d %d", &n, &d);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
int ntotal = 2;
for (i = 1; i < n; i++) {
if (A[i] - A[i-1] == 2*d) {
... |
#include<stdio.h>
int main()
{
long long int n;
long long int d;
scanf("%lld%lld",&n,&d);
long long int a[100],count=0;
long long int t;
for(long long int i=0;i<n;i++)
{
scanf("%lld",&a[i]);
}
for(long long int i=0;i<n;i++)
{
... |
#include<stdio.h>
#include<stdlib.h>
int main()
{
int n,d;
scanf("%d %d",&n,&d);
int arr[n];
int temporary[1000];
for(int o=0;o<n;o++)
scanf("%d",&arr[o]);
if(n==1)
{
printf("2");
exit(0);
}
int count=2,i=0;;
int nh=arr[0]+d;
if(arr[1]-nh>=d)
{
temporary[i]=arr[0]+d;
i++;
}
... |
#include <stdio.h>
#include <stdlib.h>
void read(long long *arr, int length) {
for (int i=0; i<length; i++) scanf("%I64d",(arr+i));
}
void assign(long long *arr, int index, long long dist, long long *mi, long long *ma) {
*mi=arr[index]-dist;
*ma=arr[index]+dist;
}
int check_dist(long long *arr, lon... |
#include<stdio.h>
#include<stdlib.h>
#define N 101
int main(){
int n,d;
scanf("%d%d",&n,&d);
int i;
int x[N];
for(i=0;i<n;i++){
scanf("%d",&x[i]);
}
int j;
int answer=0;
int y[N*2];
int ny=0;
for(i=0;i<n;i++){
int l=x[i]-d;
int r=x[i]+d;
int l1... |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <time.h>
#include <limits.h>
typedef long long ll;
ll MAX = 100000000000; // 1e11
ll MIN = -100000000000; // -1e11
ll MOD = 1000000007;
ll longlongmax = __LONG_LONG_MAX__;
ll ... |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define fo(i,a,b) for(i=(a);i<=(b);i++)
#define of(i,a,b) for(i=(a);i>=(b);i--)
#define max(a,b) (((a)>(b))?(a):(b))
#define min(a,b) (((a)<(b))?(a):(b))
#define abso(a) ((a<0)?(-(a)):(a))
typedef long long int lli;
void fastWrite(FILE * ofp,... |
main(n,i){for(scanf("%d",&n);n;--n)printf("%d",n&1);} |
main(int n){for(scanf("%d",&n);n--;putchar(n%2+48));} |
main(n,i){scanf("%d",&n);for(i=1;i<=n;++i)printf("%d",i&1);} |
#include <stdio.h>
int main(n){for(scanf("%i", &n);n--;)printf("%i",n%2);}
|
#include <stdlib.h>
#include <stdio.h>
#include <limits.h>
int main(void)
{
int n, i;
scanf("%d", &n);
for (i = 0; i < n; i++)
printf("%d", i%2);
return 0;
} |
#include <stdio.h>
int main(){
long n; scanf("%ld", &n);
for(long p = 0; p < n; p++){putchar(p & 1 ? '1' : '0');}
puts("");
return 0;
}
|
#include<stdio.h>
#define sf(a) scanf("%d", &a)
int main(){
int n, m,x,y;
sf(n);sf(m);
for(int i=0; i<m; i++){
sf(x);sf(y);
}
for(int i=0; i<n; i++){
printf("%d", i%2==0?1:0);
}
return 0;
} |
#include <stdio.h>
main()
{
int i, n_f, seg;
scanf("%i%i", &n_f, &seg);
int arr_seg[seg*2];
char arr_f[n_f];
for(i=0; i<2*seg; ++i)
{
scanf("%i", &arr_seg[i]);
}
for(i=0; i<n_f; ++i)
{
if(i%2)
{
arr_f[i]= '1';
}
... |
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
struct guest{
int l;
int r;
}a[1005];
int main(){
int i,j,m,n,d,min,k,sum;
while(scanf("%d %d",&n,&m)!=EOF){
for(i=0;i<m;i++){
scanf("%d %d",&a[i].l,&a[i].r);
}
for(i=0;i<n;i++){
if(i%2==0){
... |
#include<stdio.h>
int main()
{
int n,m, i=0;
char s[100];
int l[1001], r[1001];
scanf("%d %d", &n, &m);
if(n<1 || n>1000) return 0;
if(m<1 || m>1000) return 0;
while(i<m)
{
int z;
scanf("%d", &l[i]);
scanf("%d", &r[i]);
i++;
}
s[0]=... |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#define gcd(x,y) (y==0?x:(x%y>y?gcd(x%y,y):gcd(y,x%y)))
#define max(x,y) (x>y?x:y)
#define min(x,y) (x<y?x:y)
int main(void){
int n,m;
int l,r;
int i,j,f=0,min=1001,max=1;
scanf("%d%d",&n,&m);
for(i=0;i<m;i++){
scanf("%d%d... |
#include <stdio.h>
#include <stdbool.h>
#include <stdlib.h>
#include <math.h>
typedef struct Visitor
{
int A, B;
} Visitor;
int N, M;
Visitor vis[1001];
int cmpfunc (const void * a, const void * b)
{
Visitor *visA = (Visitor *)a;
Visitor *visB = (Visitor *)b;
return (visA->A - visB->A);
}
int main()
{
... |
#include<stdio.h>
int main()
{
/*char s[10001]={'\0'};
scanf("%s",s);*/
int n,m;
scanf("%d%d",&n,&m);
char s[n+1];
//for(int i=0;i<=n;i++)
s[n]='\0';
int ar[m][2];
for(int i=0;i<m;i++)
scanf("%d%d",&ar[i][0],&ar[i][1]);
/*for(int i=0;i<m;i++)
{
int l=ar[i][0];
... |
#include<stdio.h>
#include<string.h>
int main(void){
int n;
long long int sum=0;
scanf("%d",&n);
int x[n],ki=0,k[1000000]={0},times[1000000]={0};
for(int i=0;i<n;i++)scanf("%d",&x[i]);
for(int i=n-1;i>=0;i--){
k[i]=ki;
times[x[i]]++;
if(times[x[i]]==1)ki++;
}
memset(times,0,sizeof(tim... |
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#define MAX 100100
int n,m,x,y,a,b,d,arr[MAX],occ[100100],flag[100100],tmp,i,cnt;
long long ans;
int main(){
for(scanf("%i",&n);i<n;i++){
scanf("%i", &arr[i]);
occ[arr[i]]++;
}
for(i=0;i<100100;i++)
if(occ[i]) cn... |
//495sonyaandrobots
#include <stdio.h>
#include <string.h>
typedef long long ll;
int main()
{
ll n, i, pair = 0;
scanf("%lld", &n);
ll a[n], h[100001] = {0}, dis[n];
for (i = 0; i < n; i++)
scanf("%lld", a + i);
for (i = 0; i < n; i++)
dis[i] = 0;
h[a[0]] = dis[0] = 1;
for (i... |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int t,a[2000005],mx,p,b[2000005];
void solve(int n,int m)
{
int x=p+1,y=m-(mx-(n-x));
if (x<1 || y<1 || x>n || y>m) return;
memset(b,0,sizeof(b));
for (int i=1;i<=n;i++) for (int j=1;j<=m;j++) b[abs(i-x)+abs(j-y)]++;
for (int i=0;i<=mx;i++) if (b... |
#include<stdio.h>
#include<math.h>
int a[1000010];int cnt[1000010];
int main(void){
int m,x,y,n,max=0,t=0,q=0;
scanf("%d",&t);
for(int i=0;i<t;i++){
scanf("%d",&x);
a[x]++;
max=max>x?max:x;
}
if(t==1&&x==0){printf("1 1\n1 1");return 0;}
for(int i=0;i<=max;i++){if(a[i]<4*i){x=i;break;}}
fo... |
#include<stdio.h>
#include<stdlib.h>
int sum[1000005];
int main(void)
{
int T, n, m, i, j, x, y, p, now, temp;
scanf("%d", &T);
now = 0;
for(i=1;i<=T;i++)
{
scanf("%d", &x);
sum[x]++;
if(sum[x]==1)
now++;
}
if(sum[0]!=1)
{
printf("-1\n");
return 0;
}
for(i=1;i<=2005;i++)
{
if(sum[i]>4*i)
{
... |
int n,x,s,prev,a[10000];int *p1=a,*p2=a;main(){scanf("%d",&n);while(n--){scanf("%d",&x);if(x==1){s++;}if(*p1<x){*p1=x;}else{p1++;*p1=x;}}printf("%d\n",s);while(s--){printf("%d ",*p2);p2++;}} |
#include<stdio.h>
int main()
{
int n=0,c=0,a[10000],b[10000],m=0;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(int i=0;i<n;i++)
{m++;
if(a[i]==1){m=0;c++;}
b[c]=m;
}
printf("%d\n",c);
for(int i=1;i<=c;i++)
{
printf("%d ",b[i]+1);
}
return 0;
}
|
#include <stdio.h>
int const MAX = 1005;
int main (){
int i,n,sum = 0;
int a[MAX];
scanf("%d",&n);
for (i=0;i<n;i++){
int t;
scanf("%d",&t);
if ( t == 1)
sum++;
a[i] = t;
}
printf("%d\n",sum);
for (i=1;i<n;i++){
if (a[i] == 1)
printf ("%i ",a[i-1]);
}
printf("%i\n",a[n-1]);
return 0;
}
|
#include<stdio.h>
int N,a[1002],i,S,CNT[1002],jj;
main()
{
scanf("%d",&N);
for(i=0;i<N;i++){
scanf("%d",&a[i]);CNT[i]=1;
}
for(i=1;i<N;i++)
{
if(a[i]-1==a[i-1])CNT[jj]++;
else
{
jj++;
}
}
printf("%d\n",jj+1);
for(i=0;i<=jj;i++)
{
printf("%d ",CNT[i]);
}
}
|
#include <stdio.h>
main()
{
int n,a,a1,t=1,c=1,arr[1000],j=0;
scanf("%d",&n);
scanf("%d",&a1);
for(int i = 1; i<n; i++)
{
scanf("%d",&a);
if(a>a1) c++;
else
{
arr[j++]=c;
c=1;
t++;
}
a1=a;
}
arr[j++]=c;
printf("%d\n",j);
for(int i = 0;i<j;i++)printf("%d ... |
#include<stdio.h>
int main(){
int n, a,c=0, arr[1005], g=0, k=0, p=1,i;
scanf("%d",&n);
while(p<=n){
scanf("%d",&a);
if(a==1){
c++;
arr[k]=g;
k++;
g=1;
}
else if(a!=1) g++;
p++;
}
arr[k++]=g;
printf("%d\n",c);
for(i=0;i<k;i++)
if(arr[i]!=0) printf("%d ",arr[i])... |
#include <stdio.h>
int n,cntr=1,c=1;
int main(){
scanf("%d",&n);
int dizi[n];
scanf("%d",&dizi[0]);
for(int i=1;i<n;i++){
scanf("%d",&dizi[i]);
if(dizi[i]==1) c++;
}
printf("%d\n",c);
for(int i=1;i<n;i++){
if(dizi[i]>dizi[i-1]) cntr++;
else{
printf("%d ",cntr);cntr=1;
}
}
printf("... |
#include<stdio.h>
int main()
{
int n,i,j;
int count=0;
int k[1001];
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%d",&k[i]);
}
for (i=0;i<n;i++)
{
if (k[i]==1)
count++;
}
printf("%d\n",count);
int t=1;
for (i=0; i<n;i++)
{
if (k[i]+1==k[i+1])
{
t++;
continue;
}
else if (t>0)
{
printf("%d ",t);... |
#include <stdio.h>
#define N 1000
int aa[N + 1];
int main () {
int n, a, cnt, c, i;
scanf("%d", &n);
scanf("%d", &a);
cnt = 0, c = a;
while (--n) {
scanf("%d", &a);
if (a == 1) {
aa[cnt++] = c;
}
c = a;
}
aa[cnt++] = c;
printf("%d\n", cnt);
for (i = 0; i < cnt; i++) {
... |
#include<stdio.h>
int main(){
int arr[1009],ans[1009],temp=0,n;
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d",&arr[i]);
if(i>0&&arr[i]==1){
ans[temp++]=arr[i-1];
}
if(i==n-1){
if(arr[i]!=1)
ans[temp++]=arr[i];
}
}
if(arr[n-1]==1)
ans[temp++]=1;
printf("%d\n",temp);
for(int i=0;i<temp;i+... |
#include<stdio.h>
int stair_num[1001];//从1开始
int main(){
int N;
scanf("%d",&N);
int sum=0;
int x;
int prex=0;
for(int i=0;i<N;i++){
scanf("%d",&x);
if(prex&&x==1){
sum++;
stair_num[sum]=prex;
}
prex=x;
}
sum++;
stair_num[sum]=prex;
printf("%d\n",sum);
for(int i=1;i<=sum;i+... |
#include <stdio.h>
int n, l=0;
int main(){
fscanf(stdin,"%d",&n);
int arr[n], dp[n];
for(int i=0;i<n;i++){
fscanf(stdin,"%d",&arr[i]);
if(i-1>=0&&arr[i-1]>=arr[i]){
dp[l]=arr[i-1];
l++;
}
if(i+1==n){
dp[l]=arr[i];
l++;
}
}
fprintf(stdout,"%d\n",l);
for(int i=0;i<l;i++){
f... |
#include<stdio.h>
main()
{
int n;
scanf("%d",&n);
int s[n],i,count=1,t[n],j=0,flag=1;
for(i=0;i<n;i++) scanf("%d",&s[i]);
for(i=0;i<n-1;i++)
{
if(s[i+1]>s[i])
{
count++;
}
else
{
t[j]=count;
count=1;
j++;
flag++;
}
}
t[j]=count;
printf("%d\n",fla... |
#include <stdio.h>
int main(void) {
int t, i, j = 0, count = 0;
int a[1000], b[1000];
scanf(" %d", &t);
for(i=0; i<t; i++)
scanf(" %d", &a[i]);
for(i=0; i<t; i++){
if(a[i] == 1)
count++;
if(a[i] == 1 && i != 0){
b[j] = a[i-1];
j++;
}
}
b[j] = a[t-1];
j++;
printf("%d\n", coun... |
#include<stdio.h>
int main()
{
int n,b=0,d=0;
scanf("%d",&n);
int a[n];
for(int i=0;i<n;++i){
scanf("%d", &a[i]);
if(a[i]==1){b++;}
}
int c[b];
c[b-1]=a[n-1];
for(int i=1;i<n;++i){
if(a[i]==1){c[d]=a[i-1];d++;}
}
printf("%d\n",b);
for(i... |
#include<stdio.h>
#include<math.h>
int main()
{
int n,x[10000],xl[100000],stair=0,total=0,i,e=0,d=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&x[i]);
if(x[i]==1){d++;e=0;total=0; stair++; e=e+1; xl[d]=e ;}
if(x[i]!=1){total++; e=1+total; xl[d]=e; }
}
printf("%d\n",stair);
for... |
#include<stdio.h>
int main(){
int n,i,way=0,stair,j=0,A[1000];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&A[i]);
if(A[i]==1)
way++;
}
printf("%d\n",way);
while(way--){
stair=0;
do{
stair++;
j++;
}while(A[... |
#include<stdio.h>
int main()
{
int t;
scanf("%d", &t);
int arr[t];
int mx,i,j=0;
for(i=0;i<t;i++)
{
scanf("%d", &arr[i]);
if(arr[i]==1)
{
j++;
}
} printf("%d\n",j);
for(i=0;i<t;i++)
{
if(i>0 && arr[i]==1)
{
printf("%d ",mx);
}
mx=arr[i];
if(i==(t-1))
{
pri... |
#include <stdio.h>
int n;
int stair[1001], stairway[1001];
int main(){
int i, count=0;
scanf("%d", &n);
for(i=0; i<n; i++)
scanf("%d", &stair[i]);
for(i=0; i<n; i++){
if(stair[i]==1){
count++;
stairway[count-1]=1;
}
else{
stairway[count-1]++;
}
}
printf("%d\n", count);
for(i=0; i<coun... |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int n, prev, crnt, cnt, ans[1111];
int main()
{
scanf("%d%d", &n, &prev);
for (int i=1; i<n; i++)
{
scanf("%d", &crnt);
if (crnt<=prev) ans[cnt]=prev, cnt++;
prev=crnt;
}
printf("%d\n", cnt+1);
for (... |
#include <stdio.h>
int main(void) {
int m=0;
int x;
scanf("%d",&x);
int d[x];
int d1[x];
for(int i=0;i<x;i++){
scanf("%d",&d[i]);
}
for(int k=1;k<x;k++){
if(d[k]==1){
d1[m]=d[k-1];
m++;
}
}
printf("%d",m+1);
printf("\n");
for(int j=0;j<m;j++){
pr... |
#include<stdio.h>
int main()
{
int a=0,num,i,b;
scanf("%d",&num);
int mat[num],ans[num];
for(i=0;i<num;i++)
scanf("%d",&mat[i]);
for(i=0;i<num-1;i++)
{if(mat[i]>=mat[i+1]);
{ b=i+1;
if(mat[b]==1)
{
ans[a]=mat[i];
a++;}}}
ans[a]=mat[num-1];
printf("%d\n... |
#include<stdio.h>
int main(){
int n,i,j,z=0,count,k=-1;
scanf("%d",&n);
int a[n],b[10000];
for( i=0;i<n;i++){
scanf("%d",&a[i]);
}
for(i=0;i<n;i++){
if(a[i]==1){
z++;
}
}
for(i=0;i<n;i++){
count=0;
if(a[i]==1){
for(j=i;j<n;j++){
count++;
if(a[j+1]==1){
break;
}
}
}
if(count!=0){
k++;... |
#include<stdio.h>
int main(void){
int num;
scanf("%d",&num);
int array[num];
int value[num];
for(int t=0;t<num;t++){
scanf("%d",&array[t]);
}
int ans=1;
for(int t=1;t<num;t++){
if(array[t]<=array[t-1]){
value[ans]=array[t-1];
ans++;
}
}
value[ans]=array[num... |
#include <stdio.h>
#include <stdlib.h>
int main()
{
int n,x[1000],prev,curr,t;
t=0;prev=0;
scanf("%d",&n);
while (n--)
{
scanf("%d",&curr);
if (curr<=prev)
{
x[t++] = prev;
prev = 1;
}
prev = curr;
}
x[t++] = ... |
#include<stdio.h>
int main()
{
int n,i,m=0,ll=0;
scanf("%d",&n);
int num[n],p,nam[n];
p=1;
for(i=0;i<n;i++)
{
scanf("%d",&num[i]);
}
for(i=0;i<n-1;i++)
{
if(num[i]>=num[i+1])
{
p=p+1;
nam[m]=num[i];
m=m+1;
}
}
nam[m]=num[n-1];
printf("%d\n",p);
for(i=0;i<=m;i++)
{... |
#include<stdio.h>
int main()
{
int n,N[1000],put[1000],i,j,ct;
while(~scanf("%d",&n))
{
for(ct=0,i=0,j=0;i<n;i++)
{
scanf("%d",&N[i]);
if(N[i]==1){ct++;}
if(i!=0&&N[i]==1){
put[j]=N[i-1];j++;
}
if(i==n-1){
put[j]=N[i];j++;
}
}
printf("%d\n",ct);
for(j=0;j<ct;j++)
{
if(j!=(ct-... |
#include<stdio.h>
int main(void)
{
int n;
while(scanf("%d",&n)!=EOF)
{
int a[1007]={0};
int b[1007];
int i,j,k=0,t=0,s=0;
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
for(i=1;i<=n;i++)
{
if(a[i]>=a[i+1])
{
t++;
b[t]=a[i];
k++;
}
}
printf("%d\n",k);
for(i=1;i<=t;i++)
{
if(i==1)
... |
#include <stdio.h>
int main()
{
int num,i;
while((scanf("%d",&num))!=EOF)
{
int all,get[1005],part[1005],mark;
for(i=0;i<num;i++)
{
scanf("%d",&get[i]);
}
mark=1;
all=1;
for(i=1;i<num;i++)
{
if(get[i]==1)
{
part[all]=get[i-1];
all++;
}
}
printf("%d\n",all);
part[all++]=get[... |
#include <stdio.h>
//Compiler version gcc 6.3.0
int main()
{
int n,i,b,a[1009];
scanf("%d",&n);
int j=0,c=0,k=0;
for( i=0;i<n;i++)
{
scanf("%d",&b);
if(b==1)
{
j++;
}
if(b==1&&i>0)
{
a[k++]=c;
c=0;
}
c++;
}
a[k++]=c... |
//codeforces problem set 1005a
#include<stdio.h>
int main()
{
int n, i, arr[1000];
int stairsize[1000];
scanf("%d", &n);
for (i = 0; i < n; i += 1)
{
scanf("%d", &arr[i]);
}
int stairs = 1;
for (i = 1; i < n; i += 1)
{
if (arr[i] == 1)
{
stairs += 1;
stairsize[stairs-2] = arr[i-1];
}
}
stairsi... |
#include<stdio.h>
#include<stdlib.h>
int main(){
int n;
scanf("%d",&n);
int i,tmp;
int *b=(int *)malloc(sizeof(int)*(n+1));
int j=0;
for(i=0;i<n;i++){
scanf("%d",&tmp);
//printf("j=%d,a[%d]=%d\n",j,i,tmp);
if(tmp==1){
j++;
}
b[j]=tmp;
}
... |
#include<stdio.h>
#define sf(a) scanf("%d", &a)
int main(){
int N, i, j;
int a[1000], b[1000];
sf(N);
for(i=0; i<N; i++){
sf(a[i]);
}
int result = 0;
int temp = 0;
for(j=0; j<N; j++){
if(temp >= a[j]){
result++;
b[result-1] = temp;
}
if(j == N-1){
result++;
b[result-1] = a[... |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main(void) {
int n;
scanf("%d", &n);
int bef = 0;
int steps[n];
steps[0] = 0;
int cur_floors = 0;
while (n-- > 0) {
int cur;
scanf("%d", &cur);
if (cur <= bef) {
cur_floors++;
}
steps[cur_floors] = bef = cur;
}
... |
#include<stdio.h>
int main()
{
int n;
scanf("%d", &n);
int a[n];
for (int i=0; i<n; i++)
{
scanf("%d", &a[i]);
}
int count = 0;
for (int z=0; z<n; z++)
{
if (a[z] == 1)
{
count+=1;
}
}
printf("%d\n", count);
int steps[count];
int l = 0;
for (int x= 0; ... |
#include<stdlib.h>
#include<stdio.h>
#include<math.h>
int main()
{
int c=0; int n;
scanf("%d",&n);
int stairs[n];
for(int o=0;o<n;o++)
{
scanf("%d",&stairs[o]);
if(stairs[o]==1)
{
c+=1;
}
}
printf("%d ",c);
printf("\n");
int arr[1000];int p=0;
if(stairs[0]==1&&stairs[1]==1)
{
... |
#include<stdio.h>
int main()
{
int n,i,j=0,ans=0,ans1[1005],op,count;
for(i=0;i<1002;i++)
{
ans1[i]=0;
}
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&op);
if(op==1 && i==1)
{
ans++;
}
else if(op==1)
{ans+... |
#include<stdio.h>
int main(){
int frags[1000],inp[1002],counter,steps,n,c,tmp=0;
scanf("%d",&n);
counter=steps=c=0;
while(c<n)scanf("%d",&inp[c++]);
inp[c]=1;
c=0;
while(c<n){
if(inp[c]>=inp[c+1]){
steps++;
frags[counter]=inp[c];
counter++;
}
c++;
}
... |
#include<stdio.h>
int main()
{
int x,i,c=1,s=1,k=0;
scanf("%d",&x);
int n[x],a[x];
scanf("%d",&n[0]);
if(x==1) a[0]=c;
for(i=1;i<x;i++)
{
scanf("%d",&n[i]);
if(n[i]>n[i-1]) c++;
else
{
a[k]=c; s++; c=1; k++;
}
if(i==... |
#include<stdio.h>
int x[1005],y[1005];
int main( )
{
int n;
while(scanf("%d",&n)!=EOF)
{
int m=0,l;
for(int a=1;a<=n;a++)
scanf("%d",&y[a]);
l=y[1]-1;
for(int a=1;a<=n;a++)
{
if(l+1!=y[a])
{
m++;
x[m]=l;
l=y[a];
}
else
l=y[a];
if(a==n)... |
#include<stdio.h>
int main()
{
int num,i,j,c=0,d=0,e;
scanf("%d",&num);
int a[num];
for(i=0;i<num;i++)
{
scanf("%d",&a[i]);
if(a[i]==1){c++;}
}
int b[c];
for(i=0;i<num-1;i++)
{
if(a[i]!=1&&a[i+1]==1){b[d]=a[i];d++;}
else if(a[i]==1&&a[i+... |
#include<stdio.h>
int main()
{
int n;
scanf("%d",&n);
int x[n],y;
int a[n];
int count=0;
int check=0,t=0;
for(y=0;y<n;y++)
{
scanf("%d",&x[y]);
if(x[y]<=x[y-1]&&y!=0)
{
count++;
a[t]=check;
t++;
check=0;
}
... |
#include<stdio.h>
int ara[10000];
int main()
{
int a,b,t,i,count;
scanf("%d",&t);
count=0;
for(i=0;i<t;i++)
{
scanf("%d",&ara[i]);
if(ara[i]==1)count++;
}
printf("%d\n",count);
for(i=0;i<t;i++)
{
if(ara[i]==1 && i!=0 && i!=t-1)printf("%d ",ara[i... |
#include <stdio.h>
main(){
int i, j= 0, n, count= 0, no_str= 0;
scanf("%i", &n);
int arr_num[n], arr_count[n];
for(i=0; i<n; ++i){
scanf("%i", &arr_num[i]);
}
for(i=0; i<n; ++i){
if(arr_num[i]== 1){
arr_count[j]= count;
count= 0;
... |
#include<stdio.h>
int main()
{
int n,a[2000],i=0,b=0,t,c[2000],l=0,m,flg;
scanf("%d",&n);
while(n>=1){
scanf("%d",&a[i]);
i++;
n--;
}
for(t=0;t<=i;t++){
if(a[t]==1){
if(b>0){
c[l]=a[t-1];
l++;}
b++;
if(b>1... |
//
// Created by botayhard on 09.02.19.
//
#include<stdio.h>
int main(){
int n,a[1001],k=1,r[1002],t;
scanf("%d\n",&n);
for(int i=0;i<n;i++){
scanf("%d ",&a[i]);
if(i!=n-1){
if(a[i]==1&&i==0){a[1]=1;}
else if(a[i]==1&&i!=0){r[k]=a[i-1];k+=1;}
} else if (i==n... |
#include <stdio.h>
#include <stdlib.h>
int main()
{
int numberStairWays=0,input,limit,i,temp,stepCounter=0;
scanf("%d",&limit);
int step[limit];
for(i=0;i<limit;i++)
{
scanf("%d",&input);
if (input==1)
{
numberStairWays++;
step[stepCounter]=temp;
... |
#include<stdio.h>
int main()
{
int n;
scanf("%d\n",&n);
int arr[n];
for(int i=0; i<n; i++)
{
scanf("%d ",&arr[i]);
}
int count=0;
int no[n];
for(int i=1; i<n; i++)
{
if(arr[i]==1)
{
no[count]=arr[i-1];
count++;
}
}
i... |
#include <stdio.h>
#include <string.h>
int length,staircount;
int arr [1002],heights[1002];
int main ()
{
//freopen ("cf.in","r",stdin),freopen("cf.out","w",stdout);
scanf ("%d",&length);
for (int i=0;i<length;i++)
{
scanf ("%d",&arr[i]);
}
int j = 0;
for (int i=0;arr[i+1];i++)
{
if (ar... |
#include <stdio.h>
#define MAX_STAIRS 1000
int count[MAX_STAIRS];
int main()
{
int steps;
scanf("%d", &steps);
int last_step = -1;
int stairs = 0;
int i;
for (i = 0; i < steps; ++i) {
int step;
scanf("%d", &step);
if (step == 1 && i > 0) {
count[stairs] ... |
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
int main()
{
int fir;
scanf("%d", &fir);
int *cc = malloc(sizeof(int) * fir);
int d1 = 0;
for (int a = 0; a < fir; a++)
{
int d;
scanf("%d", &d);
cc[a] = d;
}
for (int a = 0; a < fir;... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.