I hereby claim:
- I am anudeepreddy on github.
- I am anudeepc (https://keybase.io/anudeepc) on keybase.
- I have a public key ASB33HGQx77sAaxyxxkz4F5Css7svlYHsaakJlDkJjOhzQo
To claim this, I am signing this object:
| <!doctype html> | |
| <title>Site Maintenance</title> | |
| <style> | |
| body { text-align: center; padding: 150px; } | |
| h1 { font-size: 50px; } | |
| body { font: 20px Helvetica, sans-serif; color: #333; } | |
| article { display: block; text-align: left; width: 650px; margin: 0 auto; } | |
| a { color: #dc8100; text-decoration: none; } | |
| a:hover { color: #333; text-decoration: none; } | |
| </style> |
| div { | |
| white-space: pre-wrap; | |
| } |
| package com.example.activity; | |
| import android.os.Bundle; | |
| import android.app.*; | |
| import android.content.*; | |
| import android.view.*; | |
| import android.view.View.*; | |
| import android.widget.*; | |
| public class MainActivity extends Activity { |
| #include<bits/stdc++.h> | |
| using namespace std; | |
| double n,d,e,phi; | |
| int modInverse(int a, int m) | |
| { | |
| a = a%m; | |
| for (int x=1; x<m; x++) | |
| if ((a*x) % m == 1) | |
| return x; | |
| return 1; |
I hereby claim:
To claim this, I am signing this object:
| #include<iostream> | |
| using namespace std; | |
| void traverse(int m,int n,void *_a,int _i,int _j){ | |
| int *a[m]; | |
| for(int i=0;i<m;i++) | |
| a[i]=(int *)_a+n*i; | |
| /*for(int i=0;i<m;i++) | |
| { | |
| for(int j=0;j<n;j++) | |
| cout<<a[i][j]<<" "; |
| package week10; | |
| import java.io.*; | |
| import java.util.Hashtable; | |
| import java.util.Set; | |
| import java.util.Iterator; | |
| public class PhoneDirectory { | |
| //this is the main function to search for data | |
| public static void main(String []args){ | |
| Hashtable<String,String> data=readfile("phone.txt"); |
| #include<iostream> | |
| using namespace std; | |
| struct node{ | |
| node *l; | |
| int data; | |
| node *r; | |
| }; | |
| node *last; | |
| node* create(node *root,int ele){ | |
| node* New=new node; |
| #include<stdlib.h> | |
| #include<iostream> | |
| using namespace std; | |
| struct node{ | |
| struct node *l; | |
| int data; | |
| struct node *r; | |
| }; | |
| //findmin | |
| struct node * findmin(node *root){ |