Skip to content

Commit

Permalink
Add files via upload
Browse files Browse the repository at this point in the history
  • Loading branch information
ishfar16 authored Aug 3, 2023
1 parent 4ca6367 commit 077ac6e
Show file tree
Hide file tree
Showing 72 changed files with 618 additions and 0 deletions.
Binary file added Module 6/A_Timon_and_Pumbaa.bin
Binary file not shown.
16 changes: 16 additions & 0 deletions Module 6/A_Timon_and_Pumbaa.c
Original file line number Diff line number Diff line change
@@ -0,0 +1,16 @@
#include<stdio.h>
int main()
{
int a,b;
scanf("%d %d",&a,&b);
int mns=a-b;
if(mns>=0)
{
printf("%d",mns);
}
else
{
printf("0");
}
return 0;
}
Binary file added Module 6/B_Even_Numbers.bin
Binary file not shown.
22 changes: 22 additions & 0 deletions Module 6/B_Even_Numbers.c
Original file line number Diff line number Diff line change
@@ -0,0 +1,22 @@
#include<stdio.h>
int main()
{
int n;
scanf("%d",&n);
if(n==1)
{
printf("-1\n");
}
else
{
for(int i=1;i<=n;i=i+1)
{
if (i%2==0)
{
printf("%d\n",i);
}
}

}
return 0;
}
Binary file added Module 6/B_Even_Numbers.exe
Binary file not shown.
Binary file added Module 6/C_Even_Odd_Positive_and_Negative.bin
Binary file not shown.
35 changes: 35 additions & 0 deletions Module 6/C_Even_Odd_Positive_and_Negative.c
Original file line number Diff line number Diff line change
@@ -0,0 +1,35 @@
#include<stdio.h>
int main()
{
int n;
scanf("%d",&n);
int a;
int even=0,odd=0,pos=0,neg=0;
for(int i=1;i<=n;i=i+1)
{
scanf("%d",&a);
if(a%2==0)
{
// even
even++;
}
else
{
//odd
odd++;
}

if(a>0)
{
// positive
pos++;
}
else if(a<0)
{
// neg
neg++;
}
}
printf("Even: %d\nOdd: %d\nPositive: %d\nNegative: %d",even,odd,pos,neg);
return 0;
}
Binary file added Module 6/C_Next_Alphabet.bin
Binary file not shown.
15 changes: 15 additions & 0 deletions Module 6/C_Next_Alphabet.c
Original file line number Diff line number Diff line change
@@ -0,0 +1,15 @@
#include<stdio.h>
int main()
{
char n;
scanf("%c",&n);
if(n==122)
{
printf("%c",97);
}
else
{
printf("%c",n+1);
}
return 0;
}
Binary file added Module 6/D_Ali_Baba_and_Puzzles.bin
Binary file not shown.
37 changes: 37 additions & 0 deletions Module 6/D_Ali_Baba_and_Puzzles.c
Original file line number Diff line number Diff line change
@@ -0,0 +1,37 @@
#include<stdio.h>
int main()
{
int a,b,c,d;
scanf("%d %d %d %d",&a,&b,&c,&d);
if(a+b*c==d)
{
printf("YES\n");
}
else if(a*b+c==d)
{
printf("YES\n");
}
else if(a-b+c==d)
{
printf("YES\n");
}

else if(a-b*c==d)
{
printf("YES\n");
}
else if(a+b-c==d)
{
printf("YES\n");
}

else if(a*b-c==d)
{
printf("YES\n");
}
else
{
printf("NO\n");
}
return 0;
}
Binary file added Module 6/D_Fixed_Password.bin
Binary file not shown.
18 changes: 18 additions & 0 deletions Module 6/D_Fixed_Password.c
Original file line number Diff line number Diff line change
@@ -0,0 +1,18 @@
#include<stdio.h>
int main()
{
int x;
while(scanf("%d",&x)!=EOF)
{
if(x==1999)
{
printf("Correct\n");
break;
}
else
{
printf("Wrong\n");
}
}
return 0;
}
Binary file added Module 6/E_Max.bin
Binary file not shown.
19 changes: 19 additions & 0 deletions Module 6/E_Max.c
Original file line number Diff line number Diff line change
@@ -0,0 +1,19 @@
#include<stdio.h>
int main()
{
int n;
scanf("%d",&n);
int max=0;
for(int i=1;i<=n;i=i+1)
{
int a;
scanf("%d",&a);
if(a>max)
{
max=a;
}
}
printf("%d\n",max);
return 0;
}

Empty file added Module 6/E_Max.rs
Empty file.
Binary file added Module 6/F_Multiplication_table.bin
Binary file not shown.
11 changes: 11 additions & 0 deletions Module 6/F_Multiplication_table.c
Original file line number Diff line number Diff line change
@@ -0,0 +1,11 @@
#include<stdio.h>
int main()
{
int n,i;
scanf("%d",&n);
for(i=1;i<=12;i++)
{
printf("%d * %d = %d\n",n,i,n*i);
}
return 0;
}
Binary file added Module 6/G_Katryoshka.bin
Binary file not shown.
63 changes: 63 additions & 0 deletions Module 6/G_Katryoshka.c
Original file line number Diff line number Diff line change
@@ -0,0 +1,63 @@
// #include<stdio.h>
// int main()
// {
// long long int n,m,k,ans=0;

// scanf("%lld %lld %lld", &n,&m,&k);

// long long int min;
// if(n<=m && n<=k)
// {
// min=n;
// }
// else if (m<=n && m<=k)
// {
// min=m;
// }
// else
// {
// min=k;
// }
// ans+=min;
// n-=min;
// m-=min;
// k-=min;

// n=n/2;
// if(n<k)
// {
// ans+=n;
// }
// else
// {
// ans+=k;
// }

// printf("%lld\n",ans);
// return 0;
// }

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>

int main() {
int n,v;
scanf("%d",&n);
int even_ans=0; int odd_ans=0;
for(int i=0;i<=n;i++)
{
scanf("%d",&v);
if(v%2==0)
{
even_ans=even_ans+v;
}
else
{
odd_ans=odd_ans+v;
}
}
printf("%d %d",even_ans, odd_ans);
return 0;
}
Binary file added Module 6/I_Lucky_Numbers.bin
Binary file not shown.
22 changes: 22 additions & 0 deletions Module 6/I_Lucky_Numbers.c
Original file line number Diff line number Diff line change
@@ -0,0 +1,22 @@
#include<stdio.h>
int main()
{
int n;
scanf("%d",&n);
int mod=n%10;
int dvd=n/10;
if(mod%dvd==0)
{
printf("YES");
}
else if(dvd%mod==0)
{
printf("YES");
}
else
{
printf("NO");
}

return 0;
}
Binary file added Module 6/K_Divisors.bin
Binary file not shown.
14 changes: 14 additions & 0 deletions Module 6/K_Divisors.c
Original file line number Diff line number Diff line change
@@ -0,0 +1,14 @@
#include<stdio.h>
int main()
{
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
if(n%i==0)
{
printf("%d\n",i);
}
}
return 0;
}
Binary file added Module 6/Q_Digits.bin
Binary file not shown.
25 changes: 25 additions & 0 deletions Module 6/Q_Digits.c
Original file line number Diff line number Diff line change
@@ -0,0 +1,25 @@
// #include<stdio.h>
// int main()
// {
// int a;
// scanf("%d",&a);
// while(a!=0)
// {
// printf("%d ",a%10);
// a=a/10;
// }
// return 0;
// }

#include<stdio.h>
int main()
{
int a;
scanf("%d",&a);
while(a!=0)
{
printf("%d ",a%10);
a=a/10;
}
return 0;
}
Empty file added Module 6/output.txt
Empty file.
Binary file added Module 6/output/A_Timon_and_Pumbaa.exe
Binary file not shown.
Binary file added Module 6/output/B_Even_Numbers.exe
Binary file not shown.
Binary file added Module 6/output/C_Next_Alphabet.exe
Binary file not shown.
Binary file added Module 6/output/D_Fixed_Password.exe
Binary file not shown.
Binary file added Module 6/output/G_Katryoshka.exe
Binary file not shown.
Binary file added Module 7/A_Summation.bin
Binary file not shown.
26 changes: 26 additions & 0 deletions Module 7/A_Summation.c
Original file line number Diff line number Diff line change
@@ -0,0 +1,26 @@
#include <stdio.h>
int main()
{
int N;
scanf("%d", &N);
int A[N];

for (int i = 0; i < N; i++)
{
scanf("%d", &A[i]);
}
long long int sum = 0;
for (int i = 0; i < N; i++)
{
sum = sum + A[i];
}
if(sum<0)
{
printf("%lld", sum * -1);
}
else
{
printf("%lld",sum);
}
return 0;
}
Binary file added Module 7/A_Summation.exe
Binary file not shown.
Binary file added Module 7/B_Searching.bin
Binary file not shown.
26 changes: 26 additions & 0 deletions Module 7/B_Searching.c
Original file line number Diff line number Diff line change
@@ -0,0 +1,26 @@
#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 X;
scanf("%d",&X);
int ans=-1;
int i;
for(int i=0;i<N;i++)
{
if(X==A[i])
{
ans=i;
break;
}
}
printf("%d",ans);

return 0;
}
Binary file added Module 7/B_Searching.exe
Binary file not shown.
Binary file added Module 7/C_Replacement.bin
Binary file not shown.
Loading

0 comments on commit 077ac6e

Please sign in to comment.