Search found 5 matches

by rahian
Fri Sep 30, 2011 11:36 pm
Forum: Volume 112 (11200-11299)
Topic: 11221 - Magic square palindromes.
Replies: 58
Views: 30428

Re: 11221 - Magic square palindromes

U have to check whether it is palindromes or not...
by rahian
Wed Sep 28, 2011 12:22 am
Forum: Volume 120 (12000-12099)
Topic: 12049 - Just Prune The List
Replies: 14
Views: 7170

Re: Why I m getting RE for 12049- Just Prune The List

thank u friend......... I hv solved and AC
by rahian
Thu Sep 15, 2011 1:42 pm
Forum: Volume 102 (10200-10299)
Topic: 10299 - Relatives
Replies: 57
Views: 20723

Re:

This program seems to work correctly for all inputs that I found here or made up.
But I constantly get WA
Thanks for any help

[c]#include <stdio.h>
#include <math.h>
int prime[100000];
int pl=0;
int sito(){
char p[100000];
int i,j;
p[1]=1;
p[2]=0;
for (i=2;i<=100000;++i)
if (!p )
for (j=2;j ...
by rahian
Wed Aug 17, 2011 12:37 am
Forum: Volume 119 (11900-11999)
Topic: 11965 - Extra Spaces
Replies: 31
Views: 12621

Re: 11965 - Extra Spaces

I got Accepted for this problem but i would like to know something more:
#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
int main()
{
long t,n,i,cas,j,f=0,ln,ff;

freopen("in.txt","r",stdin);
while(cin>>t)
{
cas=0;
while(t)
{
cin>>n;
getchar();
if(f)
cout<<endl ...
by rahian
Thu Aug 11, 2011 11:42 pm
Forum: Volume 120 (12000-12099)
Topic: 12049 - Just Prune The List
Replies: 14
Views: 7170

12049 - Just Prune The List

#include<stdio.h>
#define MAX 100009
int main()
{
long test,arraya[MAX],arrayb[MAX],a,b,p,max,count,i;
scanf("%lld",&test);
while(test)
{
scanf("%lld %lld",&a,&b);
for(i = 1; i <=a; i++)
{
scanf("%lld",&p);
arraya[p]++;
}
for(i = 1; i <=b; i++)
{
scanf("%lld",&p);
arrayb[p ...

Go to advanced search