Beautifull Matrix Code Forces Solution

-
  1. #include<iostream>
  2. #include<cstdlib>
  3. using namespace std;
  4. int main(){
  5. int n,i,j,s=0,s1=0,l,m;
  6. for(i=1;i<=5;i++){
  7. for(j=1;j<=5;j++){
  8. cin>>n;
  9. if(n==1){
  10. l=i;
  11. m=j;
  12. }
  13. }
  14. }
  15. s=abs(3-l);
  16. s1=abs(3-m);
  17. cout<<s+s1;
  18. }

Input
0 0 0 0 0
0 0 0 0 1
0 0 0 0 0
0 0 0 0 0
0 0 0 0 0
Output
3
Answer
3

 😀😀😀😀

If you have any doutbts comment in the below👇

Comment:







Comments

Post a Comment

Popular posts from this blog

Factorials problem spoj Solution

-
In order to find factorial of n and number zeros at the end of factorial decimal, i simply find prime factors (5) ,and find the count then the count is our required answer.  #include <iostream> using namespace std; typedef long long l; int zero(l ); int main() { l t; cin>>t; while(t--){ l n; cin>>n; cout<<zero(n)<<endl; } return 0; } int zero(l n){ l c=0; if(n<0) return 0; for(l i=5;n/i>=1;i=i*5){ c+=n/i; } return c; }
Read more

Adding Reversed Numbers Spoj Solutions

-
 #include <iostream> using namespace std; int main() { int t; cin>>t; while(t--){ long long int n,m,rev=0,rev1=0,n1,m1,s=0,r; cin>>n>>m; n1=n;m1=m; while(n>0){ rev=rev*10+n%10; n/=10; } while(m>0){ rev1=rev1*10+m%10; m/=10; } s=rev+rev1; long long int srev=0;     while(s>0){ srev=srev*10+s%10; s/=10; } cout<<srev<<endl; } return 0; } 😀😀😀😀😀😀 If you have any doubts comment below👇
Read more