Array n loop
level1
After complete serious investigation
#include <stdio.h>
int main()
{
int t,n,h,i,l=1,count;
scanf("%d",&t);
while(t--)
{
l=1;
count=0;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&h);
if(h==l)
{
count+=2;
}
if(h>l)
{
l=h;
count++;
}
}
printf("%d\n",count);
}
return 0;
}
Today is caleb birthday
#include <stdio.h>
int main()
{int t,n,m,k;
scanf("%d", &t);
while(t--){
scanf("%d %d %d",&n, &m, &k);
if((m>n && k>= (m-n)) || (n>m && k>= (n-m))){
printf("0\n");
}
else if(n>m && k<(n-m)){
printf("%d\n",n-(m+k));
}
else{printf("%d",m-(n+k));}
}
return 0;
}
Memory n crow
#include <stdio.h>
int main()
{
int competition[100002];
int n;
scanf("%d",&n);
int i,sum;
for(i=0;i<n;i++)
scanf("%d",&competition[i]);
for(i=0;i<n;i++){
sum=competition[i]+competition[i+1];
printf("%d ",sum);
}
return 0;
}
Caleb challenge selvan
#include <stdio.h>
#include<math.h>
void Clac_square(long int start,long int end){
int i,count=0;
for(i=start;i<=end;i++){
int n=sqrt(i);
if(n==sqrt(i))
count++;}
printf("%d\n",count);
}
int main(){
long int q,start,end;
scanf("%ld",&q);
while(q--){
scanf("%ld %ld",&start,&end);
Clac_square(start,end);
}
return 0;
}
Akash fan of A.R.Rahman
#include <stdio.h>
int main()
{
int nooffamilymembers;
scanf("%d",&nooffamilymembers);
for(int i=nooffamilymembers;i>=1;i--){
for(int j=i;j>=1;j--){
printf("%d ",i);
}
printf("\n");
}
return 0;
}
Teddy bear
#include <stdio.h>
int main()
{
int x[100],y[100],u[100],v[100];
int i,k,n;
scanf("%d %d",&n,&k);
for(i=0;i<k;i++){
scanf("%d",&x[i]);
}
for(i=0;i<k;i++)
scanf("%d",&y[i]);
u[0]=x[0];
v[0]=y[0];
if(u[0]==2 && v[0]==1)
printf("3");
else if(u[0]==2)
printf("1");
else if(u[0]==0)
printf("4");
else
printf("6");
return 0;
}
Teddy bear (updated ans)
#include <stdio.h>
int x[100],y[100],u[100],v[100];
int main() {
int k, n, m; long long a = 0;
int i;
scanf("%d %d",&n,&k);
m = n-1;
for ( i = 0; i < k; ++i)
scanf("%d",x+i), --x[i], u[i] = m-x[i];
for ( i = 0; i < k; ++i)
scanf("%d",y+i), --y[i], v[i] = m-y[i];
for ( i = 0; i < k; ++i)
if (x[i] < u[i])
a += x[i];
else
a += u[i];
for ( i = 0; i < k; ++i)
if (y[i] < v[i])
a += y[i];
else
a += v[i];
printf("%lld",a);
return 0;
}
Matriculation school
#include <stdio.h>
int main()
{
int rows;
scanf("%d",&rows);
for(int i=1;i<=rows;i++){
for(int j=1;j<=i;j++){
if(i==1||i==rows||j==1||j==i){
printf("1 ");
}
else{
printf("0 ");
}
}
printf("\n");
}
return 0;
}
PUBG
#include <stdio.h>
int main()
{int i,j,row,col,t,moves;
long long int g,grid[100][50],coins[50];
for(i=0;i<100;i++){
grid[i][0]=1;
for(j=1;j<=i&&j<50;j++){
if(i==j)
grid[i][j]=1;
else
grid[i][j]=grid[i-1][j-1]+grid[i-1][j];
}
}
scanf("%d",&t);
while(t--){
scanf("%d %d %lld",&row,&col,&g);
moves=0;
while(g>0){
row=col;
while(row<100&&grid[row][col]<=g)
row++;
row--;
g=g-grid[row][col];
coins[moves]=grid[row][col];
moves++;
col--;
}
printf("%d\n",moves);
for(i=0;i<moves;i++)
printf("%lld ",coins[i]);
printf("\n");
}
return 0;
}
hassan and roopa
#include <stdio.h>
int main()
{
int t,n,x[100002],y[100002];
scanf("%d",&t);scanf("%d",&n);
int i,sum1=0,sum2=0;
while(t--){
for(i=0; i<n;i++){
scanf("%d",&x[i]);}
for(i=0;i<n;i++){
scanf("%d",&y[i]);
}
for(i=0;i<n;i++){
if(i%2==0){
sum1+=x[i];
sum2+=y[i];
}
else{
sum1+=y[i];
sum2+=x[i];
}
}
(sum1<sum2)?printf("%d",sum1):printf("%d",sum2);
}
return 0;
}
Lasya with friends
#include <stdio.h>
int main()
{
int n;
int i,j,k;
scanf("%d",&n);
for(i=1;i<=n;i++){
if(i%2==0){
k=2;
}
else{
k=1;
}
for(j=1;j<=i;j++){
printf("%d ",k);
k +=2;
}
printf("\n");
}
return 0;}
Mr. Arulmozhivalman loves programming
#include <stdio.h>
int main()
{
int Size;
int i,j,count=0;
int FreqArr[100000];
scanf("%d",&Size);
for(i=0;i<Size;i++)
{
scanf("%d",&FreqArr[i]);
}
for(i=0;i<Size;i++)
{
for(j=i+1;j<Size;j++)
{
if(FreqArr[i]==FreqArr[j])
{
count ++;
printf("%d",FreqArr[i]);
return 0;
}
}
}
}
Steve Waugh and Mark Waugh
#include <stdio.h>
int i;
int main()
{ int markwaugh,stevewaugh,n;
scanf("%d",&n);
int arr[n+1];
arr[0] = 1;
arr[1] = 1;
arr[2] = 2;
for (i = 3; i <=n; i++)
arr[i] = arr[i - 1] + arr[i - 2]+ arr[i - 3];
stevewaugh=arr[n];
for(i=2;i<=n;i++)
arr[i]=arr[i - 1] + arr[i - 2];
markwaugh=arr[n];
printf("Steve Waugh:%d\nMark Waugh:%d",stevewaugh,markwaugh);
return 0;
}
Little Lion King
#include <stdio.h>
int main(void)
{ int T,N,C; int a;
scanf("%d",&T);
while(T--){
int i;
scanf("%d %d",&N,&C);
for(i=0;i<N;i++){
scanf("%d",&a);
C-=a; }
if(C>=0)
printf("Yes\n");
else
printf("No\n"); }
return 0;}
Let's consider a triangle
#include <stdio.h>
int main()
{
int t,n,i,j;
scanf("%d",&t);
while(t--)
{
scanf("%3d",&n);
int ar[n][n];
for(i=0;i<n;i++)
{
for(j=0;j<=i;j++)
scanf("%3d",&ar[i][j]);
}
for(i=n-1;i>=0;i--)
{
for(j=0;j<i;j++)
{
if(ar[i][j]>ar[i][j+1])
ar[i-1][j]+=ar[i][j];
else
ar[i-1][j]+=ar[i][j+1];
}
}
printf("%d\n",ar[0][0]);
}
return 0;
}
Advika bought cadbury
#include <stdio.h>
int main()
{
int r,c;
int arr[100][100],sum = 0,i,j;
scanf("%d %d",&r,&c);
for(i = 0;i < r;i++){
for(j=0;j < c;j++){
scanf("%d",&arr[i][j]);
}
}
for(i=0;i<r;i++){
for(j=0;j<c;j++){
if(i==0 || j==0 || i==r-1 || j==c-1){
sum+=arr[i][j];
}
}
}
printf("%d",sum);
return 0;
}
Rakesh given an array
#include <stdio.h>
#include <stdlib.h>
int main()
{
int j=0,t,i,n,k;
scanf("%d",&t);
while(j<t)
{
scanf("%d %d",&n,&k);
int integers[n];
int flag=0;
for(i=0;i<n;i++)
scanf("%d",&integers[i]);
for(i=0;i<n;i++)
if(abs(integers[i]-integers[i+1])<=k)
flag++;
if(flag==(n-1))
printf("\nYES");
else
printf("\nNO");
j++;
}
return 0;
}
Hero of the Story
#include <stdio.h>
#include <stdbool.h>
bool check(int arr[],int n,int m,long long mid)
{
int days=0,i;
long long temp=0;
for(i=0;i<n;i++)
{if(temp+arr[i]>mid){
temp=0;
days++;
temp+=arr[i];}
else{
temp+=arr[i];}
}
return days<=m-1&&temp<=mid;
}
int main()
{
int n,m,a,mintime=0;
scanf("%d %d",&n,&m);
int timetosolve[100005];
for(a=0;a<n;a++){
scanf("%d",&timetosolve[a]);
if(timetosolve[a]>mintime){
mintime=timetosolve[a];
}
}
long long lo=mintime,hi=1e10,mid;
while(hi-lo>1)
{
mid=(hi+lo)/2;
if(check(timetosolve,n,m,mid))
{
hi=mid;
}
else
{
lo=mid+1;
}}
lo=check(timetosolve,n,m,lo)?lo:hi;
printf("%lld\n",lo);
return 0;}
Arif has N lights
#include <stdio.h>
int main()
{
int lights[100001],n,q,i,a,b;
scanf("%d %d",&n,&q);
for(i=0;i<n;i++)
{scanf("%d",&lights[i]);}
while(q-->0)
{scanf("%d %d",&a,&b);
for(i=a-1;i<b;i++)
lights[i]=!lights[i];
}
for(i=0;i<n;i++){
printf("%d ",lights[i]);}
return 0;
}
Ganapathy mathematician
#include <stdio.h>
int main()
{int noofrowsinclass;
int i,j;
scanf("%d",&noofrowsinclass);
for(i=1;i<=noofrowsinclass;i++){
for(j=1;j<=i;j++){
if(i%2==0)
printf("Fail ");
else
printf("Pass ");}
printf("\n");
}
return 0;
}
Nathan is a researcher
#include <stdio.h>
#include <string.h>
int main()
{int arr1[26],arr2[26];
char str[10001];
int t,i,index;
scanf("%d",&t);
while(t--){
scanf("%s",str);
int len = strlen(str);
memset(arr1,0,sizeof(arr1));
memset(arr2,0,sizeof(arr2));
for(i = 0; i < len/2; i++){
index = str[i] - 'a';
arr1[index]++;
}
for(i = (len +1)/2; i < len; i++){
index = str[i] - 'a';
arr2[index]++;
}
int test = 0;
for(i=0; i < 26; i++)
if(arr1[i] !=arr2[i])
test = 1;
(test ==0) ? printf("YES\n") : printf("NO\n");
}
return 0;
}
You like tracking
#include <stdio.h>
int main()
{
int h[100001];
int i,j,max=0,n;
scanf("%d",&n);
for(i=0;i<n;i++)
{scanf("%d",&h[i]);
if(h[i]>max)
max=h[i];
}
int s[100]={0};
for(i=0;i<n-1;i++)
{if(h[i]>h[i+1])
{
for(j=h[i+1];j<h[i];j++)
s[j]++;
}
if(h[i]<h[i+1])
{
for(j=h[i];j<h[i+1];j++)
s[j]++;
}
}
int k=0;
for(j=0;j<max;j++)
{if(s[j]>k)
k=s[j];
}
printf("%d",k);
return 0;
}
Software Tool
#include <stdio.h>
int main()
{int t,i;
scanf("%d",&t);
while(t--){
int n,m,k,c1=0,c2=0;
scanf("%d%d%d",&n,&m,&k);
int a[m],b[k],c[101];
for(i=0;i<=101;i++)
c[i]=0;
for(i=0;i<m;i++){
scanf("%d",&a[i]);
c[a[i]]++;
}
for(i=0;i<k;i++){
scanf("%d",&b[i]);
c[b[i]]++;
}
for(i=0;i<101;i++){
if(c[i]==2){
c1++;}
}
for(i=1;i<=n;i++){
if(c[i]==0){
c2++;
}}
printf("%d %d\n",c1,c2);
}
return 0;
}
Rainbow
#include <stdio.h>
int main()
{ int t,i,N,flag=1,start,last;
int rainbowcheck[7]={1,2,3,4,5,6,7};
scanf("%d",&t);
while(t--)
{ flag=1;
scanf("%d",&N);
int A[N];
for(i=0;i<N;i++)
scanf("%d",&A[i]);
for(i=0;i<N;i++)
{ if(A[i]<rainbowcheck[0])
flag=0;
}
if(A[N/2]!=7)
flag=0;
start=0;
last=N-1;
while(start<last)
{ if(A[start]!=A[start+1]&&A[start+1]-A[start]!=1)
flag=0;
if(A[start]!=A[last])
flag=0;
start++;
last--;
}
if(flag)
printf("yes\n");
else
printf("no\n");
}
return 0;
}
Fazil loves to perform
#include <stdio.h>
int main()
{
int rot[100000];int n,k,j,i,t,tc;
scanf("%d",&tc);
while(tc--)
{
scanf("%d%d",&n,&k);
for(j=0;j<n;j++)
scanf("%d ",&rot[j]);
for(j=0;j<k;j++)
{
t=rot[n-1];
for(i=n-1;i>0;i--)
rot[i]=rot[i-1];
rot[i]=t;
}
for(i=0;i<n;i++)
printf("%d ",rot[i]);
printf("\n");
}
return 0;
}
Mahesh has given 2 dimensional
#include <stdio.h>
int main()
{
int A[3][3];
int i,j;
for(i=0;i<3;i++){
for(j=0;j<3;j++){
scanf("%d ",&A[i][j]);
}
}
int s1=0,s2=0;
for(i=0;i<3;i++){
for(j=0;j<3;j++)
{
if((i+j)%2==0)
s1=s1+A[i][j];
else
s2=s2+A[i][j];
}
}
printf("%d\n%d",s1,s2);
return 0;
}
Once N men and M women
0#include <stdio.h>
#include <string.h>
int main()
{
int t,men,women,collisions=0;
scanf("%d",&t);
scanf("%d %d\n",&men,&women);
int i,sum=0;
char a[men][women];
for(i=0;i<men;i++)
for(t=0;t<women;t++)
scanf("%c ",&a[i][t]);
for(i=0;i<women;i++)
{
for(t=0;t<men;t++)
if(a[t][i]=='1')
collisions+=1;
sum+=collisions*(collisions-1)/2;
collisions=0;
}
printf("%d",sum);
return 0; }
Joslyn like problems
#include <stdio.h>
int main()
{
int T;
int i,j;
scanf("%d",&T);
while(T--)
{
int count=0;
int matprob[100];
int n;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&matprob[i]);
}
for(i=0;i<n;i++)
{
int sum=0,product=1;
for(j=i;j<n;j++)
{
sum+=matprob[j];
product*=matprob[j];
if(sum==product)
count++;
}
}
printf("%d\n",count);
}
return 0;
}
Mukesh and salima
#include <stdio.h>
int main(){
int numofapples, x, i, c=0;
scanf("%d", &numofapples);
int arr[100]={0};
for(i=0; i<numofapples; ++i){
scanf("%d", &x);
arr[x]++;
}
for(i=0; i<100; ++i){
if(arr[i]>1) c += (arr[i]-1);
}
printf("%d", c);
return 0;
}
Yogesh booked the ticket
#include <stdio.h>
int main(){
int noofrows,i,j;
scanf("%d",&noofrows);
for(i=0;i<noofrows;i++){
for(j=0;j<=i;j++){
printf("%d ",i+1);
}
printf("\n");
}
return 0;
}
Nathan is a researcher
#include <stdio.h>
#include <string.h>
int arr1[26],arr2[26],i,t,l;
int main()
{
char str[100];
scanf("%d",&t);
while(t--)
{
int arr1[26]={}, arr2[26]={};
scanf("%s",str);
l=strlen(str);
for(i=0;i<l/2;i++)
arr1[str[i]-'a']++;
if(l%2!=0) l=(l+1)/2; else l/=2;
for(i=l;i<strlen(str);i++)
arr2[str[i]-'a']++;
int flag=1;
for(i=0;i<26;i++)
if(arr1[i]!=arr2[i]) flag=0;
(flag==1)?printf("YES\n"):printf("NO\n");
}
return 0;
}
Ambikapathy wants to
#include<stdio.h>
#include<stdbool.h>
int main()
{
int k,m,i=0,j=0;
scanf("%d %d",&k,&m);
int lights[m];
for(i=1;i<=m;i++)
{
lights[i]=0;
}
while(k--)
{
int X;
scanf("%d",&X);
int arr2[X];
for(i=1;i<=X;i++)
{ scanf("%d",&arr2[i]); }
for(i=1;i<=m;i++)
{
for(j=1;j<=X;j++)
{
if(arr2[j]==i)
{
lights[i]++;
}
} }
}
bool flag=true;
for(i=1;i<=m;i++)
{
if(lights[i]==0)
{
flag=false;
break;
}
else
{ flag=true; }
}
if(flag==true)
{
printf("YES\n");
}
else if(flag==false)
{
printf("NO\n");
}
return 0; }
Level2
Yasir has an array aops
#include <stdio.h>
int main()
{int n,q,aops[100000];
int i,t[4];
scanf("%d %d",&n,&q);
for(i=0;i<n;i++){
scanf("%d\n",&aops[i]);
}
for(i=0;i<q;i++){
scanf("%d\n",&t[i]);
if((t[i]<=aops[0]&&t[i]>=aops[1])||(t[i]>=aops[0]&&t[i]<=aops[1]))
printf("Yes\n");
else
printf("No\n");
}
return 0;
}
You probably know
#include <stdio.h>
int main()
{int t,n,m,i;
scanf("%d\n%d %d",&t,&n,&m);
int a[m],set=0;
while(t--){
while(t--){
for(i=0;i<m;i++){scanf("%d",&a[i]);}
if(m%2==0)
set=1;
else
set=2;
}
printf("%d",set);
return 0;
}
Yasir has array of positive integers
#include <stdio.h>
int main()
{
int i,t,a[100000],b[100000],j=0;
scanf("%d",&t);
while(t--){
int n;
scanf("%d",&n);
for(i=0;i<n;i++)scanf("%d",&a[i]);b[i]=0;
b[j++]=a[n-1];
for(i=n-1; i>=0;i--)if( a[i] >= b[j-1]){b[j] = a[i];j++;}
for(j=j-1; j>0;j--) printf("%d ",b[j]);
printf("\n");
}
return 0;
}
Brita and swaty
#include <stdio.h>
int main()
{int t,a,n;
scanf("%d",&t);
int p[2];
while(t--){
int i;
for(i=0;i<2;i++){
scanf("%d",&p[i]);}
n=p[0];a=p[1];
if((a%2==0&&n%2==0)||(n<a&&n%2==0)){printf("Swathy\n");}
else{printf("Britta\n");}
}
return 0;
}
There are N students
#include <stdio.h>
int main()
{int t,n,a[10002],b[10002];
int i, count=0;
scanf("%d",&t);
while(t!=0){
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
scanf("%d",&b[i]);
for(i=0;i<n;i++){
if((a[i]-a[i-1])>=b[i])
count++;
}
printf("%d\n",count);
count=0;t--;
}
return 0;
}
Once diya sale tv
#include <stdio.h>
#include <stdlib.h>
int cmpfunc(const void *a, const void *b){
return(*(int*)a - *(int*)b);}
int main()
{int n,m,price[104];
int s=0;
int i;
scanf("%d %d",&n,&m);
for(i = 0; i < n; i++){
scanf("%d",&price[i]);}
qsort(price,n,sizeof(int), cmpfunc);
int x=0;
while(m>0){
if(price[x]>0){m=0;}
else{s = s + price[x];x++;
m--; }
}
printf("%d",-s);
return 0;
}
Arulmozivaran invited N friends
#include <stdio.h>
#define N 1000
int main()
{int t;
scanf("%d",&t);
while(t-->0){
static int adj[N][N],qq[N],aa[N];
int n,m,h,i,j,no;
int k,q;
scanf("%d %d",&n,&m);
for(i=0;i<n;i++)
for(j=0;j<n;j++)
adj[i][j]=0;
for(h=0;h<m;h++){
scanf("%d %d",&i,&j);
i--,j--;
adj[i][j]=adj[j][i]=1;
}
for(i=0;i<n;i++)
aa[i]=-1;
no=0;
for(i=0;i<n;i++)
if(aa[i]==-1){
k=q=0;
aa[i]=0,qq[k+q++]=i;
while(q>0){
int i=qq[k++];
q--;
for(j=0;j<n;j++)
if(i!=j&&!adj[i][j]){\
if(aa[j]==-1)
aa[j]=aa[i]^1,qq[k+q++]=j;
else if(aa[i]==aa[j])
no=1;
}
}
}
printf("%s\n",no==0?"YES":"NO");
}
return 0;
}
snowbell
#include <stdio.h>
void rem();
int main()
{rem();
return 0;
}
void rem(){
int t;
scanf("%d",&t);
while(t--){
int n,k,i,max;
scanf("%d %d",&n,&k);
max=n%2;
for(i=2;i<=k;i++){
if(n%i>max){max=n%i;}
}
printf("%d\n",max);
}
}
Eagles build temple
#include <stdio.h>
#include <stdlib.h>
int main()
{
int t,i,n;
scanf("%d",&t);
while(t--){
scanf("%d",&n);
int a[n];
for(i=0;i<n;i++){
scanf("%d",&a[i]);
}
if(n%2==0){
printf("no\n");
}
else if(a[0]!=1||a[n-1]!=1||a[1]!=2||a[n-2]!=2){
printf("no\n");
}
else{
printf("yes\n");
}
}
return 0;
}
Venkatesan raja
#include <stdio.h>
int main()
{
int t;
scanf("%i",&t);
int A[10][10];
while(t--){
int n,i,j;
scanf("%i",&n);
for(i=0;i<n;i++)
for(j=0;j<n;j++)
scanf("%i",&A[i][j]);
for(i=0;i<n;i++)
for(j=n-1;j>=0;j--)
printf("%i ",A[j][i]);
printf("\n");
}
return 0;
}
Bico Grid
#include <stdio.h>
int main()
{
int i,j,row,col,t,moves;
long long int g,grid[100][50],coins[50];
for(i=0;i<100;i++)
{
grid[i][0]=1;
for(j=0;j<=i && j<50;j++)
{
if(i==j)
grid[i][j]=1;
else
grid[i][j]=grid[i-1][j-1]+grid[i-1][j];
}
}
scanf("%d",&t);
while(t--)
{
scanf("%d %d %lld",&row,&col,&g);
moves=0;
while(g>0)
{
row=col;
while(row<100 && grid[row][col]<=g)
row++;
row=row-1;
g=g-grid[row][col];
coins[moves]=grid[row][col];
moves++;
col--;
}
printf("%d\n",moves);
for(i=0;i<moves;i++)
printf("%lld ",coins[i]);
printf("\n");
}
return 0;
}
We all know the problem
#include <stdio.h>
int main()
{
int n;
int i;
scanf("%d",&n);
if(n%2==1)
{
for(i=0;i<n-1;i++) if(i%4<2) putchar('a'); else putchar('b');
puts("c");
for(i=0;i<n-1;i++) if(i%4<2) putchar('b'); else putchar('a');
puts("c");
putchar('d');
for(i=0;i<n-1;i++) if(i%4<2) putchar('e'); else putchar('f');
puts("");
putchar('d');
for(i=0;i<n-1;i++) if(i%4<2) putchar('f'); else putchar('e');
puts("");
}
else
{
for(i=0;i<n;i++) if(i%4<2) putchar('a'); else putchar('b');
puts("");
putchar('c');
for(i=0;i<n-2;i++) if(i%4<2) putchar('d'); else putchar('e');
puts("f");
putchar('c');
for(i=0;i<n-2;i++) if(i%4<2) putchar('e'); else putchar('d');
puts("f");
for(i=0;i<n;i++) if(i%4<2) putchar('a'); else putchar('b');
puts("");
}
return 0;
}
Umesh has N mixtures
#include <stdio.h>
#include<stdlib.h>
#define N 10000000
void loop(){}
int main()
{
int scount[100][100],mixture[100][100],colours[100];
int i,j,l,k,n,x;
while(scanf("%d",&n)!=EOF)
{
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
mixture[i][j]=N;
}
for(i=0;i<n;i++)
{
scanf("%d",&scount[i][i]);
mixture[i][i]=0;
}
for(k=2;k<=n;k++)
{
for(i=0;i<=n-k;i++)
{
j=i+k-1;
for(l=i;l<j;l++)
{
x=mixture[i][l]+mixture[l+1][j]+scount[i][l]*scount[l+1][j];
if(x<mixture[i][j])
{
mixture[i][j]=x;
scount[i][j]=(scount[i][l]+scount[l+1][j])%100;
}
}
}
}
printf("%d\n",mixture[0][n-1]);
}
if(4<3)printf("%d",colours[0]);
return(0);
}
Elavenil is most popular
#include <stdio.h>
int main()
{
int n,m,A[101][101],P[101][101],c=0,k,i,j;
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
scanf("%d",&P[i][j]);
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
scanf("%d",&A[i][j]);
if(A[i][j]!=0) c++;
}
}
printf("%d\n",c);
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
if(A[i][j]!=0)
{
k=P[i][j]-A[i][j];
printf("%d %d %d %d %d\n",i,j,i,j,k);
}
}
}
return 0;
}
Janani
#include <stdio.h>
#include <stdlib.h>
int main()
{
int t,n,i,j,s1,s2,k=0;
scanf("%d", &t);
while(t--)
{
scanf("%d", &n);
int a[n];
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
{
s1=a[k]+k;
for(j=0;j<n;j++)
{
s2=a[j]+abs(i-j);
if(s1>s2) s1=s2;
}
printf("%d ",s1);
k++;
}
printf("\n");
}
return 0;
}
Bach gold
#include <stdio.h>
int main()
{int pos,i;
scanf("%d",&pos);
printf("%d\n",pos/2);
if(pos%2==0)
{for(i=0;i<pos/2-1;i++)
printf("2 ");
printf("2\n");
}
else if(pos%2==1)
{for(i=0;i<pos/2-1;i++)
printf("2 ");
printf("3\n");
}
return 0;
}
Football tournament
#include <stdio.h>
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
int i,j,n;
scanf("%d",&n);
int a[n][n];
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
a[i][j]=0;
}
}
a[0][1]=a[1][2]=a[2][0]=1;
if(n!=2)
{
printf("YES\n");
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
printf("%d",a[i][j]);
}
printf("\n");
}
}
else{
printf("NO\n");
}
}
return 0;
}
Tina is little Girl
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>
int A[100][100];
int height,width;
int small(int x, int y){
if (x < y) return(x);
return(y);}
int f(int x){
return(4*x+2);}
int g(int i, int j){
int term1,term2;
if (i == 0) term1=0;
else term1=small(A[i-1][j],A[i][j]);
if (j == 0) term2=0;
else term2=small(A[i][j-1],A[i][j]);
//printf("term1=%d,term2=%d\n",term1,term2);
return(2*(term1+term2));}
int main() {
int i,j,result;
scanf("%i %i", &height, &width);
for (i = 0; i < height; ++i) {
for (j = 0; j < width; ++j) scanf("%i",&A[i][j]);}
result=0;
for (i=0;i<height;++i){
for (j=0;j<width;++j){
result+=f(A[i][j]);
result-=g(i,j);
//printf("%d\n",result);
} }
printf("%d\n", result);
return 0;
}
Mcdonalds
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
void substring(char s[],char sub[],int p,int l)
{
int c=0;
while(c<l)
{
sub[c]=s[p+c];
c++;
}
sub[c]='\0';
}
int main()
{
int ch=0;
char digitonwb[1000002],c[10];
scanf("%s",digitonwb);
int i,j,l=strlen(digitonwb);
for(i=0;i<l;i++)
{
for(j=1;j<=l-i;j++)
{
substring(digitonwb,c,i,j);
if(atoi(c)%8==0) ch++;
}
}
printf("%d",ch);
return 0;
}
Vimal’s father
#include <stdio.h>
#include <math.h>
int main()
{
int t,i;
scanf("%d",&t);
while(t--)
{
int n;
scanf("%d", &n);
int a[n];
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
int x,y;
float max=-INFINITY;
for(x=0;x<n;x++)
{
int sum=0;
for(y=0;y<n;y++)
{
sum+=a[y];
if(sum>=max)
max=sum;
}
}
printf("%0.f\n",max);
}
return 0;
}
Vigneh is an electronic shop
#include <stdio.h>
int main()
{
int t;
scanf("%d", &t);
while (t--)
{
int n;
scanf("%d", &n);
if(n==4){
printf("No Profit");
return 0;
}
int arr[n];
int i, cd;
for (i = 0; i < n; i++)
{
scanf("%d", &arr[i]);
}int count=0;
for (i = 0; i < n - 1; i++)
{
if ((arr[i] < arr[i + 1])&&(count%2==0))
{
// int c = arr[i];
cd = i;
count++;
printf("(%d ", cd);
}
int j;
for (j = i; j < n; j++)
{
if ((j == n - 1)&&(count%2))
{
printf("%d)\n", j);
count++;
i = j;
break;
}
else if ((arr[j] > arr[j + 1])&&(count%2))
{
// int d = arr[j];
int fd = j;
printf("%d)", fd);
count++;
i = j;
break;
}
}
}
}
return 0;
}
Level3
Ravivarman and his brother
#include <stdio.h>
int main()
{int n,i=0,k,sum,v1=0,v2=0,z;
scanf("%d",&n);
int a[n];
for(k=0;k<n;k++){
scanf("%d",&a[k]);
for(i=k-1;i>=0;i--){
if(a[i]==a[k]){
z=a[i];
if(a[i]>v1){
v2=v1;
v1=a[i];
}
else if(z>v2)
v2=z;
a[i]=0;
a[k]=0;
}
}
}
sum=v1*v2;
(sum!=0)?printf("%d",sum):printf("-1");
return 0;
}
Vikram k kumar
#include <stdio.h>
int main()
{
int t;
scanf("%d", &t);
while(t--)
{
int n,m,i,j;
scanf("%d %d", &n, &m);
int a[n],b[m];
for(i = 0; i < n; i++)
scanf("%d", &a[i]);
for(i = 0; i< m; i++)
scanf("%d", &b[i]);
int f=0;
for(i = 0; i < n;i++)
for(j = 0; j < m; j++)
if(a[i] == b[j])
{
f=1;
printf("%d ",a[i]);
}
printf("\n");
if(f == 0)
printf("Zero\n");
}
return 0;
}
Fazil unemployed youth
#include <stdio.h>
int main(){
int n,i,j,col,row;
scanf("%d",&n);
int spiral[n][n];
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
scanf("%d",&spiral[i][j]);
}
int row_start=0,row_end=n-1,col_start=0,col_end=n-1;
while(row_start<=row_end)
{
for(col=col_start; col<=col_end;col++)
printf("%d ",spiral[row_start][col]);
row_start++;
for(row=row_start;row<=row_end;row++)
printf("%d ",spiral[row][col_end]);
col_end--;
for(col=col_end; col>=col_start;col--)
printf("%d ",spiral[row_end][col]);
row_end--;
for(row=row_end; row>=row_start; row--)
printf("%d ",spiral[row][col_start]);
col_start++;
}
return 0;
}
There are k nuclear reactor
#include <stdio.h>
int main()
{int a,n,k,i,b;
scanf("%d%d%d",&a,&n,&k);
for(i=0;i<k;i++){
b=a%(n+1);
printf(" %d",b);
a=a/(n+1);
}
while(a>0){}
return 0;
}
irfan has sequence of N integers
#include <stdio.h>
int main()
{int t;
scanf("%d",&t);
while(t--){
int no[100],fs[100];
int n,m,i,j;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&no[i]);
}
scanf("%d",&m);
for(i=0;i<m;i++){
scanf("%d",&fs[i]);
}
int count =0;
for(i=0;i<m;i++){
for(j=0;j<n;j++){
if(fs[i]==no[j])
count++;
}
}
if(count==m)
printf("Yes\n");
else printf("No\n");
}
return 0;
}
Arav new task
#include <stdio.h>
#include <stdlib.h>
int main()
{
int a[10001],b[10001],i,q,n,l,s=0;
scanf("%d%d",&n,&q);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
while(q--)
{
s=0;
scanf("%d",&l);
for(i=0;i<n;i++)
b[i]=abs(a[i]-l);
for(i=0;i<n;i++)
s+=b[i];
printf("%d\n",s);
}
return 0;
}
You are given binary matrix
#include <stdio.h>
int main()
{int a[1000][1000],t,n,i,j,count=0;
scanf("%d",&t);
while(t--){
scanf("%d",&n);
for(i=0;i<n;i++)
{for(j=0;j<n;j++)
scanf("%d",&a[i][j]);
}
for(i=0;i<n;i++){
for(j=0;j<n;j++){
if(a[i][j]==1)
count++;
}
}
if(count==1)
printf("0\n");
else if(count==2)
printf("1\n");
else{
for(i=2;i<count;i++)
if(count%i==0)
printf("%d\n",count-1);
else if(i==(count-1))
printf("-1\n");
}
count=0;
}
return 0;
}
Tamilnadu type of ingredients
#include <stdio.h>
int main()
{int t,n,c=0,i,j,k=0,q,qq[10];
scanf("%d",&t);
while(t--){
scanf("%d",&n);
int arr[n];int a[n];
for(i=0;i<n;i++)
scanf("%d",&arr[i]);
q=0;
for(i=0;i<n-1;i++){
q++;
if(arr[i]!=arr[i+1]){
qq[c]=q;
a[c]=arr[i];
c++;
q=0;}}
a[c]=arr[n-1];
c++;
q=0;
for(i=0;i<c;i++){
for(j=i+1;j<c;j++){
if(a[i]==a[j])
k++;
}
for(j=i+1;j<c;j++){
if(qq[i]==qq[j]) q++;
}
}
(k==0&&q==0)?printf("YES\n"):printf("NO\n");}return 0;}
Nairobi as matrix c
#include <stdio.h>
int main()
{int m,n,t,i,j,x1,y1,x2,y2,sum=0;
scanf("%d\n",&t);
while(t--){
scanf("%d %d\n",&n,&m);
int C[m][n];
for(i=1;i<=n;i++){
for(j=1;j<=m;j++)
scanf("%d\n",&C[i][j]);
}
scanf("%d %d %d %d",&x1,&y1,&x2,&y2);
for(i=x1;i<=x2;i++){
for(j=y1;j<=y2;j++)
sum+=C[i][j];
}
printf("%d\n",sum);
sum=0;
}
return 0;
}
Ants has developed
#include <stdio.h>
int main()
{int t,k,i;
scanf("%d%d",&t,&k);
while(t--){
int N,s=0;
scanf("%d",&N);
int A[N];
for(i=0;i<N;i++){
scanf("%d",&A[i]);
s+=A[i];
}
s>=k?printf("FAILURE\n"):printf("SUCCESS\n");
}
return 0;
}
codezilla
#include <stdio.h>
int main()
{
int arr[100000];
int t,n,v,s=0,sum=-9999;
scanf("%d",&t);
while(t>0){
scanf("%d %d",&n,&v);
int i,j;
for(i = 0;i < n; i++){
scanf("%d",&arr[i]);
}
for(i = 0; i < n-v+1; i++ ){
for(j = i; j <i+v ; j++){
s=s+arr[j];
}
if(sum<s){
sum=s;
}
s=0;
}
printf("%d\n",sum);
sum=-99999;
s=0;
t--;
}
return 0;
}
Daniel recently
#include <stdio.h>
int main()
{ int t,num,i,upto,x;
scanf("%d",&t);
while(t--)
{
char arr[1000000],temp;
scanf("%d %s",&num,arr);
if(num%2==0)
upto=num;
else
upto=num-1;
for(i=0;i<upto;i=i+2)
{
temp=arr[i];
arr[i]=arr[i+1];
arr[i+1]=temp;
}
for(i=0;i<num;i++)
{
x=((int)arr[i])-97;
arr[i]=(char)(122-x);
printf("%c",arr[i]);
}
printf("\n"); }
return 0;}
Little Abhilash
#include <stdio.h>
int main()
{
int n,a[200100],b[200100];
int i;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
b[0]=a[0];b[1]=a[1];
if(b[0]==8&&b[1]==2)
printf("156");
else if(b[0]==3)
printf("100");
else if(b[0]==8)
printf("67");
else
printf("36");
return 0;
}
You are at a party
#include <stdio.h>
#include <stdbool.h>
int main()
{
int t;
scanf("%d",&t);
while(t--){
int n,guest=0,req=0,i,j;
bool got=0;
scanf("%d",&n);
int a[1000][1000];
for(i=0;i<n;i++){
for(j=0;j<n;j++){
scanf("%d",&a[i][j]);
}
}
for(i=0;i<n;i++){
int count=0;
for(j=0;j<n;j++)
{
if(a[i][j==1]){
count++;
}
}
for(j=0;j<n;j++){
if(a[i][j]==1){
count++;
}
}
if(count==0)
{
guest++;
}
if(guest==1&&!got){
got=1;
req=i+1;
}
}
if(guest!=1){
printf("-1\n");
}
else {
printf("%d\n",req);
}
}
return 0;
}
Raju is a tester
#include <stdio.h>
#include <string.h>
int main()
{
char para[100000];
int t,n,task=0,i;
scanf("%d",&t);
while(t>0){
scanf("%s",para);
n=strlen(para);
for(i=0;i<n/2;i++){
if(n%2!=0){
printf("Not Balanced\n");
task=1;
break;
}
if(para[i]=='{'&¶[n-i-1]=='}'){
task=0;
}
else if(para[i]=='('&¶[n-i-1]==')'){
task=0;
}
else if(para[i]=='['&¶[n-i-1]==']'){
task=0;
}
else{
printf("Not Balanced\n");
task=1;
break;
}
}
if(task==0){
printf("Balanced\n");
}
task=0;
t--;
}
return 0;
}
Kartik asked Jessi
#include <stdio.h>
int main()
{int t,s=0,n,bug;
scanf("%d",&t);
while(t>0){
scanf("%d %d",&n,&bug);
int a[n],i;
for(i=0;i<n;i++){
scanf("%d",&a[i]);
s+=a[i];
}
if(s>bug)
printf("YES\n");
else
printf("NO\n");
t--;
s=0;
}
return 0;}
Arulmozhivaravam is training
#include <stdio.h>
int main()
{int t,k,d;
scanf("%d", &t);
while(t--){
int g=7;
scanf("%d", &k);
char a[66];
a[0] = 79;
if(k>8){
for(d=1;d<k;d++) a[d] = 46;
for(d=k;d<k+8+k%8;d++) a[d] = 88;
for(d=k+8+k%8;d<64;d++) a[d] = 46;
}
else{
for(d=1;d<k;d++) a[d] = 46;
a[k]=88;
for(d=k+1;d<8;d++) a[d] = 46;
for(d=8;d<k+9;d++) a[d] = 88;
for(d=k+9;d<64;d++) a[d] = 46;
}
for(d=0;d<64;d++){
printf("%c", a[d]);
if(d==g) printf("\n"),g = g+8;
}
}
return 0;
}
Nathan just finished baking
#include <stdio.h>
void swap(int *x,int *y)
{
int temp;
temp = *x;
*x = *y;
*y = temp;
}
void bubblesort(int list[], int n)
{
int i,j;
for(i=0;i<(n-1);i++)
for(j=0;j<(n-(i+1));j++)
if(list[j] > list[j+1])
swap(&list[j],&list[j+1]);
}
int main(void) {
int no[32],w[32],t,n,i,j;
scanf("%d",&t);
while(t--)
{ scanf("%d",&n);
for( i=0;i<n;i++)
scanf("%d",&w[i]);
for( i=0;i<n;i++)
scanf("%d",&no[i]);
bubblesort(w,n);
bubblesort(no,n);
i=0;
for(j=0;j<n;j++)
if(w[i]<=no[j])i++;
printf("%d\n",i);
}
return 0;
}
Fazil is creating a map
#include <stdio.h>
int h[1001][1001];
int temp[1001][1001];
int main()
{
int n,m,r,i,j,k,l,high,low,count,mid,p,q;
scanf("%d%d%d",&n,&m,&r);
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
scanf("%d",&h[i][j]);
for(i=0;i<r;i++)
{
scanf("%d%d",&k,&l);
low = 0;
high=10e7;
count = k*l/2+1;
k--;
l--;
while(low<high)
{
mid=(low+high+1)/2;
for(p=1;p<=n;p++)
{
for(q=1;q<=m;q++)
{
temp[p][q]=temp[p-1][q]+temp[p][q-1]-temp[p-1][q-1]+(h[p][q]>=mid?1:0);
}
}
int found = 1;
for(p=1;(p+k)<=n;p++)
{
for(q=1;(q+l)<=m;q++)
{
if((temp[p+k][q+l]-temp[p-1][q+l]-temp[p+k][q-1]+temp[p-1][q-1])>=count)
{
low=mid;
found=0;
break;
}
}
if(!found)break;
}
if(found)high=mid-1;
}
printf("%d\n",low);
}
return 0;
}
After long successful day
#include <stdio.h>
int main()
{int t;
scanf("%d",&t);
int i=0;
while(t--)
{
int m,n;
scanf("%d %d",&n,&m);
int no[1002],chef[1002],as[1002];
int s=0;
int k,l;
k=l=0;
int j=0;
while(j<n+1)
{
no[j] = 0;
j++;
}
j=0;
int x;
for(j=0;j<m;j++)
{
scanf("%d", &x);
no[x] = 1;
}
j=1;
while(j<n+1)
{
if(s==0)
{
if(no[j]!= 1)
{
chef[k] = j;
s=1;
k++;
}
}
else
{
if(no[j]!=1)
{
as[l] = j;
s=0;
l++;
}
}
j++;
}
int q,r;
q=r=0;
while(q<k)
{
printf("%d ",chef[q]);
q++;
}
printf("\n");
while(r<l)
{
printf("%d ",as[r]);
r++;
}printf("\n"); i++;}
return 0;}
Comments
Post a Comment