visit here...
http://www.geocities.com/acmbeganer/p10295io.htm
Search found 7 matches
- Thu Jul 27, 2006 4:32 am
- Forum: Volume 102 (10200-10299)
- Topic: 10295 - Hay Points
- Replies: 20
- Views: 12834
- Sun Jul 16, 2006 5:57 am
- Forum: C
- Topic: data type... (long int, long long int)
- Replies: 8
- Views: 9453
data type... (long int, long long int)
hi,
i don't know how 'long long int' work.
for example,
i hava input...
1 2
3 4
5 6
7 8
and first code,
#include <stdio.h>
int main()
{
long long int a, b;
while (scanf ("%lld%lld",&a, &b)!=EOF){
printf("%lld %lld\n", a, b);
}
return 0;
gives output
1 0
3 0
5 0
7 0 ...
i don't know how 'long long int' work.
for example,
i hava input...
1 2
3 4
5 6
7 8
and first code,
#include <stdio.h>
int main()
{
long long int a, b;
while (scanf ("%lld%lld",&a, &b)!=EOF){
printf("%lld %lld\n", a, b);
}
return 0;
gives output
1 0
3 0
5 0
7 0 ...
- Thu Jul 13, 2006 12:37 am
- Forum: Volume 5 (500-599)
- Topic: 576 - Haiku Review
- Replies: 50
- Views: 22476
576 Haiku Review... WA.
i don't know why i got WA.
plz anybody help me... or give me sample input data... :D
here my code.
#include<iostream>
#include<string>
#include<stdio.h>
using namespace std;
bool isVowel(char c){
switch(c)
{
case 'a':
case 'e':
case 'i':
case 'o':
case 'u':
case 'y':
return true ...
plz anybody help me... or give me sample input data... :D
here my code.
#include<iostream>
#include<string>
#include<stdio.h>
using namespace std;
bool isVowel(char c){
switch(c)
{
case 'a':
case 'e':
case 'i':
case 'o':
case 'u':
case 'y':
return true ...
- Sat Jul 08, 2006 4:56 pm
- Forum: Volume 1 (100-199)
- Topic: 113 - Power of Cryptography
- Replies: 163
- Views: 51214
thanks~
you are right!
and i got accepted, with 'long double' .. ^^..
and i got accepted, with 'long double' .. ^^..
- Sat Jul 08, 2006 3:36 pm
- Forum: Volume 6 (600-699)
- Topic: 623 - 500!
- Replies: 187
- Views: 72035
thanks alot
898989,
your idea looks, very impresive... ^^... i'll try it~
your idea looks, very impresive... ^^... i'll try it~

- Sat Jul 08, 2006 3:17 pm
- Forum: Volume 1 (100-199)
- Topic: 113 - Power of Cryptography
- Replies: 163
- Views: 51214
about 'long' and 'long double'
in problem 113 'Power of Cryptography' ,
i code,
long double n, k, p;
while (cin >> n >> p)
{
k = pow(p,(1/n));
printf("%.0lf\n", k);
}
and got WA. so~ so~ many times...
but,
double n, k, p;
while (cin >> n >> p)
{
k = pow(p,(1/n));
printf("%.0lf\n", k ...
i code,
long double n, k, p;
while (cin >> n >> p)
{
k = pow(p,(1/n));
printf("%.0lf\n", k);
}
and got WA. so~ so~ many times...
but,
double n, k, p;
while (cin >> n >> p)
{
k = pow(p,(1/n));
printf("%.0lf\n", k ...
- Tue Jul 04, 2006 1:06 am
- Forum: Volume 6 (600-699)
- Topic: 623 - 500!
- Replies: 187
- Views: 72035
623 - 500! WA
this is my code.
#include <iostream>
#include <string>
#include <stdio.h>
using namespace std;
class BigInteger{
public:
string* str;
int sign;
public:
/* */
BigInteger(string a);
BigInteger(char* a);
BigInteger(int i);
BigInteger();
//
~BigInteger();
//
BigInteger& operator ...
#include <iostream>
#include <string>
#include <stdio.h>
using namespace std;
class BigInteger{
public:
string* str;
int sign;
public:
/* */
BigInteger(string a);
BigInteger(char* a);
BigInteger(int i);
BigInteger();
//
~BigInteger();
//
BigInteger& operator ...